Arrow Research search
Back to STOC

STOC 2012

On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity

Conference Paper Session 4A Algorithms and Complexity · Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
605156471965799983