43

An Optimal Parallel Algorithm for Formula Evaluation
– S. Buss, S. Cook, A. Gupta, V. Ramachandran
 1992

151

On uniform circuit complexity
– W L Ruzzo
 1981

209

Boundedwidth polynomialsize branching programs recognize exactly those languages
– A. Barrington
 1986

127

On Uniformity within NC¹
– David A. Mix Barrington, Neil Immerman, Howard Straubing
 1990

274

Descriptive Complexity
– Neil Immerman
 1998

119

On Uniformity Within NC 1
– David A. Mix Barrington, Neil Immerman, Howard Straubing
 1990

18

Algorithms for Boolean Formula Evaluation and for Tree Contraction
– Samuel R. Buss
 1991

24

Log Space Recognition and Translation of Parenthesis Languages
– Nancy Lynch
 1977

121

Parallel Tree Contraction and its Application
– G L Miller, J H Reif
 1985

239

The parallel evaluation of general arithmetic expressions
– Richard P. Brent
 1974

74

Borel sets and circuit complexity
– M Sipser
 1983

115

Feasibly constructive proofs and the propositional calculus
– Stephen Cook
 1975

80

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

17

A secondorder system for polytime reasoning based on Grädel's theorem
– Stephen Cook, Antonina Kolokolova
 2001

28

An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic
– Alexander A. Razborov
 1993

58

Notes on Polynomially Bounded Arithmetic
– Domenico Zambella

29

FirstOrder Proof Theory of Arithmetic
– Samuel R. Buss
 1998

12

A bounded arithmetic AID for Frege systems
– Toshiyasu Arai

78

Lectures on Proof Theory
– Samuel Buss, A. Maciel (mcgill, E. Allender (rutgers, P. Mckenzie
 1996
