80

Counting problems in bounded arithmetic
– Jeff B Paris, Alex J Wilkie

54

An application of boolean complexity to separation problems in bounded arithmetic
– Samuel R. Buss, Jan Krajlcek
 1994

115

Feasibly constructive proofs and the propositional calculus
– Stephen Cook
 1975

211

Bounded Arithmetic, Propositional Logic, and Complexity Theory
– J Krajíček
 1995

121

Bounded Arithmetic, Bibliopolis
– S R Buss
 1986

58

Notes on Polynomially Bounded Arithmetic
– Domenico Zambella

27

Relating the Bounded Arithmetic and Polynomial Time Hierarchies
– Samuel R. Buss, Then T
 1994

330

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

27

Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic
– Samuel R. Buss
 1990

31

Quanti propositional calculi and fragments of Bounded Arithmetic, Zeitschrift f. math. Logik und Grundlagen d
– J Krajcek, P Pudlak
 1990

13

Relating the PSPACE reasoning power of Boolean Programs and Quantified Boolean Formulas
– Alan Skelley
 2000

57

Bounded arithmetic and the polynomial hierarchy
– J Krajíček, P Pudlák, G Takeuti
 1991

14

Boolean programs and quantified propositional proof systems
– Stephen Cook, Michael Soltys
 1999

55

The relative complexity of NP search problems
– Paul Beame, Stephen Cook , Jeff Edmonds , Russell Impagliazzo , Toniann Pitassi
 1997

84

Pudlák: Propositional proof systems, the consistency of first order theories and the complexity of computations
– J Krajíček, P
 1989

21

On Frege and Extended Frege Proof Systems
– Jan Krajicek
 1993

14

Lifting Independence Results in Bounded Arithmetic
– Mario Chiari, Jan Krajicek
 1999

114

The Complexity of the Pigeonhole Principle
– M Ajtai
 1988

264

The intractability of resolution
– A Haken
 1985
