Proof complexity
![A Reduction of Proof Complexity to Computational Complexity for $ AC^ 0 [P] $ Frege Systems](http://data.docslib.org/img/264x/2ea56b0fdd2a2e570454a78f7d07f6b4.webp)
Top View
- Towards NP−P Via Proof Complexity and Search
- Why Are Proof Complexity Lower Bounds Hard?
- Proof Complexity
- Proof Complexity
- Statement of Research
- SIGACT News Complexity Theory Column 91
- Circuit Complexity, Proof Complexity and Polynomial Identity Testing (Extended Abstract)
- On the Proof Complexity of Deep Inference—Conjecture
- Proof Complexity and SAT Solving Sam Buss and Jakob Nordstr¨Om
- Contents Part 1. a Tour of Propositional Proof Complexity 2 1. Is There a Way to Prove Every Tautology with a Short Proof? 2 2
- Some Open Problems in Bounded Arithmetic and Propositional Proof Complexity (Research Proposal Paper)
- Proof Complexity
- Small Circuits and Dual Weak PHP in the Universal Theory of P-Time Algorithms
- Proof Complexity Lower Bounds from Algebraic Circuit Complexity
- Foundations of Proof Complexity: Bounded Arithmetic and Propositional Translations
- On the Correspondence Between Arithmetic Theories and Propositional Proof Systems - a Survey
- Proof Complexity and SAT Solving Sam Buss and Jakob Nordstr¨Om