Relating the Bounded Arithmetic and Polynomial Time Hierarchies (1994)

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

Documents Related by Co-Citation

58 Notes on Polynomially Bounded Arithmetic – Domenico Zambella
210 Bounded Arithmetic, Propositional Logic, and Complexity Theory, volume 60 of Encyclopedia of Mathematics and its Applications – Jan Kraj´ıček - 1995
115 Feasibly constructive proofs and the propositional calculus – Stephen Cook - 1975
54 An application of boolean complexity to separation problems in bounded arithmetic – Samuel R. Buss, Jan Krajlcek - 1994
121 Bounded Arithmetic, Bibliopolis – S R Buss - 1986
35 Witnessing Functions in Bounded Arithmetic and Search Problems – Mario Chiari, Jan Krajicek - 1994
80 Counting problems in bounded arithmetic – Jeff B Paris, Alex J Wilkie
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
22 Fragments of bounded arithmetic and bounded query classes – J Krajíček - 1993
21 Gaisi Takeuti, Bounded arithmetic and the polynomial hierarchy – Jan Krajíček, Pavel Pudlák - 1991
55 The relative complexity of NP search problems – Paul Beame, Stephen Cook , Jeff Edmonds , Russell Impagliazzo , Toniann Pitassi - 1997
326 The relative efficiency of propositional proof systems – Stephen A. Cook, Robert, A. Reckhow - 1979
13 Dynamic ordinal analysis – Arnold Beckmann
12 Relating the provable collapse of P to NC 1 and the power of logical theories – Stephen A Cook - 1998
14 Boolean programs and quantified propositional proof systems – Stephen Cook, Michael Soltys - 1999
21 On Frege and Extended Frege Proof Systems – Jan Krajicek - 1993
113 The complexity of the pigeonhole principle – M Ajtai - 1994
37 Papadimitriou and Mihalis Yannakakis. How Easy is Local Search – David S Johnson, H Christos - 1988