|
163
|
Short Proofs are Narrow - Resolution made Simple
– Eli Ben-sasson, Avi Wigderson
- 2000
|
|
195
|
Many hard examples for resolution
– V Chvátal, E Szemerédi
- 1988
|
|
244
|
The intractability of resolution
– Armin Haken
- 1985
|
|
120
|
examples for resolution
– Hard
- 1987
|
|
52
|
Resolution proofs of generalized pigeonhole principles
– Samuel R. Buss, Győrgy Turán
- 1988
|
|
50
|
Reckhow, The relative eciency of propositional proof systems
– S A Cook, R A
- 1979
|
|
636
|
A machine program for theorem proving
– M Davis, G Logemann, D Loveland
- 1962
|
|
35
|
Resolution and the weak pigeonhole principle
– Sam Buss, Toniann Pitassi
- 1997
|
|
86
|
Using the Groebner basis algorithm to find proofs of unsatisfiability
– Matthew Clegg, Jeffery Edmonds, Russell Impagliazzo
- 1996
|
|
285
|
The relative efficiency of propositional proof systems
– Stephen A. Cook, Robert, A. Reckhow
- 1979
|
|
37
|
Space Complexity In Propositional Calculus
– Michael Alekhnovich , Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
- 2002
|
|
71
|
Lower Bounds for Cutting Planes Proofs with Small Coefficients
– Maria Luisa Bonet, Toniann Pitassi, Ran Raz
- 1995
|
|
33
|
Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus
– Alexander Razborov, Avi Wigderson, Andrew Yao
- 1997
|
|
25
|
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
– Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi
- 1998
|
|
251
|
On the complexity of derivation in propositional calculus
– G Tseitin
- 1983
|
|
14
|
Using the Groebner basis algorithm to proofs of unsatis
– M Clegg, J Edmonds, R Impagliazzo
- 1996
|
|
152
|
Natural Proofs
– Alexander A. Razborov, Steven Rudich
- 1994
|
|
67
|
Some Consequences of Cryptographical Conjectures for . . .
– Jan Krajícek , Pavel Pudlák
- 1995
|
|
90
|
The Complexity Of Propositional Proofs
– Alasdair Urquhart
- 1995
|
