Relating the Bounded Arithmetic and Polynomial Time Hierarchies (1994)

by Samuel R. Buss , Then T
Venue:Annals of Pure and Applied Logic
Citations:27 - 1 self

Documents Related by Co-Citation

58 Notes on Polynomially Bounded Arithmetic – Domenico Zambella
211 Bounded Arithmetic, Propositional Logic, and Complexity Theory – J Krajíček - 1995
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
121 Bounded Arithmetic, Bibliopolis – S R Buss - 1986
35 Witnessing Functions in Bounded Arithmetic and Search Problems – Mario Chiari, Jan Krajicek - 1994
21 Gaisi Takeuti, Bounded arithmetic and the polynomial hierarchy – Jan Krajíček, Pavel Pudlák - 1991
57 Bounded arithmetic and the polynomial hierarchy – J Krajíček, P Pudlák, G Takeuti - 1991
27 Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic – Samuel R. Buss - 1990
80 Counting problems in bounded arithmetic – Jeff B Paris, Alex J Wilkie
22 Fragments of bounded arithmetic and bounded query classes – J Krajíček - 1993
114 The Complexity of the Pigeonhole Principle – M Ajtai - 1988
13 Dynamic ordinal analysis – Arnold Beckmann
45 On the scheme of induction for bounded arithmetic formulas – A Wilkie, J Paris - 1987
88 Functional interpretations of feasibly constructive arithmetic – Stephen Cook, Alasdair Urquhart - 1993
28 An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic – Alexander A. Razborov - 1993
775 The complexity of theorem-proving procedures – Stephen A. Cook - 1971
55 The relative complexity of NP search problems – Paul Beame, Stephen Cook , Jeff Edmonds , Russell Impagliazzo , Toniann Pitassi - 1997
7 A note on bounded arithmetic – P Pudlák - 1990