Abstract. We show that the known bounded-depth proofs of the Weak
|
247
|
The relative efficiency of propositional proof systems
– Cook, Reckhow
- 1979
|
|
230
|
The intractability of resolution
– Haken
- 1985
|
|
142
|
Bounded Arithmetic, Propositional Logic, and Complexity Theory
– Kraj'icek
- 1995
|
|
120
|
Exponential lower bounds for the pigeonhole principle
– Pitassi, Beame, et al.
- 1993
|
|
104
|
The complexity of the pigeonhole principle
– Ajtai
- 1988
|
|
86
|
Proof Theory
– Takeuti
- 1987
|
|
73
|
Metamathematics of First-Order Arithmetic
– Hájek, Pudlák
- 1993
|
|
66
|
Provability of the pigeonhole principle and the existence of infinitely many primes
– Paris, Wilkie, et al.
- 1988
|
|
59
|
Polynomial size proofs of the Propositional Pigeonhole Principle
– Buss
- 1987
|
|
58
|
A Woods. Exponential lower bounds to the size of bounded depth Frege proofs of the pigeonhole principle. Random Structures and Algorithms
– Krajíček, Pudlák
- 1995
|
|
56
|
Resolution proofs of generalized pigeonhole principles
– Buss, Turán
- 1988
|
|
33
|
A new proof of the weak pigeonhole principle
– Maciel, Pitassi, et al.
|
|
23
|
Some problems in logic and number theory and their connections
– Woods
- 1981
|
|
20
|
Time-space tradeoffs for satisfiability
– Fortnow
|
|
19
|
On the complexity of SAT
– Lipton, Viglas
- 1999
|
|
17
|
Time-space tradeoffs for nondeterministic computation
– Fortnow, Melkebeek
- 2000
|
|
10
|
Fragments of Peano's arithmetic and the MRDP theorem
– Gaifman, Dimitracopoulos
- 1982
|
|
9
|
Division is in uniform TC
– Hesse
- 2001
|
|
8
|
Primes and their residue rings in models of open induction
– Macintyre, Marker
- 1989
|
|
6
|
Combinatorial principles in elementary number theory
– Berarducci, Intrigila
- 1991
|
|
2
|
Rudimentary predicates and Turing calculations
– Nepomnjascij
- 1970
|
