181

Short Proofs are Narrow  Resolution made Simple
– Eli Bensasson, Avi Wigderson
 2000

214

Many hard examples for resolution
– V Chvátal, E Szemerédi
 1988

264

The intractability of resolution
– A Haken
 1985

128

examples for resolution
– Hard
 1987

97

Using the Groebner basis algorithm to find proofs of unsatisfiability
– Matthew Clegg, Jeffery Edmonds, Russell Impagliazzo
 1996

51

Resolution proofs of generalized pigeonhole principles
– Samuel R. Buss, Győrgy Turán
 1988

50

The Relative Eciency of Propositional Proof systems
– Stephen Cook, Robert Reckhow
 1979

330

The relative efficiency of propositional proof systems
– Stephen A. Cook, Robert, A. Reckhow
 1979

742

A machine program for theorem proving
– Martin Davis, George Logemann, Donald Loveland
 1962

36

Resolution and the weak pigeonhole principle
– Sam Buss, Toniann Pitassi
 1997

39

Space Complexity In Propositional Calculus
– Michael Alekhnovich , Eli BenSasson, Alexander A. Razborov, Avi Wigderson
 2002

77

Lower Bounds for Cutting Planes Proofs with Small Coefficients
– Maria Luisa Bonet, Toniann Pitassi, Ran Raz
 1995

34

Readonce branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus
– Alexander Razborov, Avi Wigderson Y, Andrew Yao Z
 1997

28

Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
– Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi
 1998

303

On the complexity of derivation in propositional calculus
– Grigori Tseitin
 1968

74

Some Consequences of Cryptographical Conjectures for . . .
– Jan Krajícek , Pavel Pudlák
 1995

14

Using the Groebner basis algorithm to proofs of unsatis
– M Clegg, J Edmonds, R Impagliazzo
 1996

173

Natural Proofs
– Alexander A. Razborov, Steven Rudich
 1994

105

The Complexity Of Propositional Proofs
– Alasdair Urquhart
 1995
