Opening (abstract)

On Some Conjectures in Proof Complexity (abstract)

Size-Space Bounds and Trade-offs for CDCL Proofs (abstract)

Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction (abstract)

A (Biased) Survey of Space Complexity and Time-Space Trade-offs in Proof Complexity (abstract)

Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds (abstract)

Provably Total Search Problems in Fragments of Bounded Arithmetic Below Polynomial-time (abstract)

Parameter-free induction in bounded arithmetic (abstract)

Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic (abstract)

Quasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Finite Sets (abstract)

n^O(log log n) size monotone proofs of the weak pigeonhole principle (abstract)

Weak Pigeonhole Principles, Circuits for Approximate Counting, and Bounded-Depth Proofs (abstract)

Total Space in Resolution (abstract)

From Small Space to Small Width in Resolution (abstract)

Are matrix identities hard instances for strong proof systems? (abstract)

Lower bounds for splittings by linear combinations (abstract)

Narrow Proofs May Be Maximally Long (abstract)

Parity games and propositional proofs (abstract)