Author of the publication

Proof complexity.

. Computational Complexity Theory, volume 10 of IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness., , , and . Comput. Complex., 15 (4): 391-432 (2006)Optimal bounds for decision problems on the CRCW PRAM., and . J. ACM, 36 (3): 643-670 (1989)Optimizing symbolic model checking for statecharts, , , , , and . Software Engineering, IEEE Transactions on, 27 (2): 170--190 (2001)A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata., , , , and . SIAM J. Comput., 28 (3): 1051-1072 (1999)Counting of Query Expressions: Limitations of Propositional Methods., , , and . ICDT, page 177-188. OpenProceedings.org, (2014)Stabbing Planes., , , , , , and . ITCS, volume 94 of LIPIcs, page 10:1-10:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space., , and . STOC, page 213-232. ACM, (2012)Proof complexity.. Computational Complexity Theory, volume 10 of IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems., and . STOC, page 688-697. ACM, (2002)Using Problem Structure for Efficient Clause Learning., , and . SAT, volume 2919 of Lecture Notes in Computer Science, page 242-256. Springer, (2003)