Back to Results
First PageMeta Content
Theoretical computer science / Computational complexity theory / Mathematics / Automated theorem proving / Logic in computer science / Rules of inference / Resolution / Proof complexity / Conflict-Driven Clause Learning / Boolean algebra / Exponential time hypothesis / PP


On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity [Extended Abstract] Trinh Huynh
Add to Reading List

Document Date: 2012-03-28 07:53:42


Open Document

File Size: 388,91 KB

Share Result on Facebook