Birs- 20w5144: Proof Complexity
-
Title: Proof Complexity 2020
Speaker:
Link:
-
Title: Semialgebraic Proofs and Efficient Algorithm Design
Speaker:
Link:
-
Title: Hardness Condensation
Speaker:
Link:
-
Title: Polynomial Calculus Space and Resolution Width
Speaker:
Link:
-
Title: Size-Degree Trade-Off for Sums-of-Squares Proofs
Speaker:
Link:
-
Title: Dmitry Sokolov: (Semi)Algebraic Proofs over $\{\pm 1\}$ Variables
Speaker:
Link:
-
Title: On Depth 1 Frege Systems
Speaker:
Link:
-
Title: and Edward Hirsch: Semi-Algebraic Proofs, IPS Lower Bounds and the $\tau$-Conjecture: Can a Natural Number be Negative?
Speaker:
Link:
-
Title: Consistency of Circuit Lower Bounds with Bounded Theories
Speaker:
Link:
-
Title: Why are Proof Complexity Lower Bounds Hard?
Speaker:
Link:
-
Title: Characterising QBF Hardness via Circuit Complexity
Speaker:
Link:
-
Title: Sum of Squares Bounds for the Ordering Principle
Speaker:
Link:
-
Title: Resolution and the binary encodings of combinatorial principles
Speaker:
Link:
-
Title: The Surprising Power of Constant Depth Algebraic Proofs
Speaker:
Link:
-
Title: Lifting in Proof Complexity
Speaker:
Link:
-
Title: Automating Resolution is NP-Hard
Speaker:
Link:
-
Title: Automated Proof Search: The Aftermath
Speaker:
Link:
-
Title: Resolution Lower Bounds for Refutation Statements
Speaker:
Link:
-
Title: SETH and Resolution
Speaker:
Link:
-
Title: Reversible Pebble Games and the Relation between Tree-like and General Resolution
Speaker:
Link: