|
10
|
Bounded Arithmetic and Propositional Proof Complexity
– Samuel R. Buss
- 1995
|
|
25
|
Theories for Complexity Classes and their Propositional Translations
– Stephen Cook
- 2004
|
|
6
|
Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic
– Arnold Beckmann, Samuel R. Buss
- 2008
|
|
2
|
A Bottom-Up Approach to Foundations of Mathematics
– Pavel Pudlak
|
|
7
|
The provable total search problems of bounded arithmetic
– Alan Skelley, Neil Thapen
- 2007
|
|
15
|
How to Lie Without Being (easily) Convicted and the Lengths of Proofs in Propositional Calculus
– Pavel Pudlák, Samuel R. Buss
|
|
16
|
Structure and Definability in General Bounded Arithmetic Theories
– Chris Pollett
- 1999
|
|
3
|
Bounded arithmetic, cryptography, and complexity
– Samuel R. Buss
- 1997
|
|
6
|
Quantified Propositional Calculus and a Second-Order Theory for NC¹
– Stephen Cook, Tsuyoshi Morioka
- 2004
|
|
|
A Propositional Proof System for. . .
– Chris Pollett
|
|
|
On the Lengths of Proofs of Consistency - a Survey of Results
– Pavel Pudlák
|
|
2
|
Ordinal Notations and Well-Orderings in Bounded Arithmetic
– Arnold Beckmann, Samuel R. Buss, Chris Pollett
- 2002
|
|
1
|
Consistency and Games|in Search of New Combinatorial Principles
– Pavel Pudlák
- 2004
|
|
43
|
Predicative Recursion and Computational Complexity
– Stephen J. Bellantoni
- 1992
|
|
27
|
Relating the Bounded Arithmetic and Polynomial Time Hierarchies
– Samuel R. Buss, Then T
- 1994
|
|
10
|
Polynomial-size Frege and Resolution Proofs of st-Connectivity and Hex Tautologies
– Samuel R. Buss
- 2003
|
|
4
|
Separating dag-like and tree-like proof systems
– Phuong Nguyen
- 2007
|
|
5
|
Separation Results for the Size of Constant-Depth Propositional Proofs
– Arnold Beckmann, Samuel R. Buss
- 2004
|
|
1
|
A Propositional Proof System for Log Space
– Steven Perron
|
