| Authors | Title | Paper | Talk |
|---|
| Albert Atserias | Weak Pigeonhole Principles, Circuits for Approximate Counting, and Bounded-Depth Proofs |  | Jul 13 10:45 |
| Fu Li and Iddo Tzameret | Generating Matrix Identities and Hard Instances for Strong Proof Systems | | Jul 13 14:30 |
| Jakob Nordström | A (Biased) Survey of Space Complexity and Time-Space Trade-offs in Proof Complexity | | Jul 12 14:30 |
| Pavel Pudlák | On Some Conjectures in Proof Complexity | | Jul 12 11:00 |
| James Aisenberg, Maria Bonet and Sam Buss | Quasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Finite Sets | | Jul 13 09:15 |
| Albert Atserias, Massimo Lauria and Jakob Nordström | Narrow Proofs May Be Maximally Long | | Jul 13 16:30 |
| Ilario Bonacina, Nicola Galesi and Neil Thapen | Total Space in Resolution | | Jul 13 12:00 |
| Hubie Chen | Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction | | Jul 12 12:30 |
| Anupam Das | $n^{O(\log \log n)}$ size monotone proofs of the weak pigeonhole principle | | Jul 13 09:45 |
| Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström and Marc Vinyals | From Small Space to Small Width in Resolution | | Jul 13 12:30 |
| Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström and Marc Vinyals | Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds | | Jul 12 15:30 |
| Dmitry Itsykson and Dmitry Sokolov | Lower bounds for splittings by linear combinations | | Jul 13 15:30 |
| Emil Jeřábek | Parameter-free induction in bounded arithmetic | | Jul 12 17:00 |
| Jan Johannsen, Massimo Lauria, Jakob Nordstrom and Marc Vinyals | Size-Space Bounds and Trade-offs for CDCL Proofs | | Jul 12 12:00 |
| Ján Pich | Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic | | Jul 12 17:30 |
| Jean-Jose Razafindrakoto and Arnold Beckmann | Provably Total Search Problems in Fragments of Bounded Arithmetic Below Polynomial-time | | Jul 12 16:30 |
| Neil Thapen, Arnold Beckmann and Pavel Pudlák | Parity games and propositional proofs | | Jul 13 17:00 |