Workshop on Limits of Theorem Proving

- Stephen Cook The Complexity and Proof Complexity of the Comparator Circuit Value Problem
- Jakob Nordström On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity
- Iddo Tzameret Short proofs for the determinant identities
- Rahul Santhanam Proof Complexity and Algorithmic Analysis
- Chris Beck Time Space Tradeoffs in Proof Complexity
- Sam Buss Collapsing Modular Counting in Bounded Arithmetic and Constant Depth Propositional Proofs
- Albert Atserias Analysis of clause-learning algorithms with many restarts
- Federico Ricci-Tersenghi Phase transitions and computational complexity: a physicist point of view
- Jan Kraj´ıˇcek On the computational complexity of finding hard tautologies
- Edward Hirsch Distributional proving problems, and beyond
- Iddo Tzameret Interpolation and refutation algorithms
- Oliver Kullman The connection of SAT (solving!) and (proof) complexity
- Ilario Bonacina: A combinatorial characterization of space for algebraic systems
- Christoph Berkholz: On the Complexity of Finding Narrow Proofs
- Jan Kraj´ıˇcek and Jakob Nordstr¨om Communications
- Leszek Kolodziejczyk Short pool resolution proofs of stone tautologies
- Pavel Pudl´ak Proof complexity of the Ramsey theorem