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

Active Bibliography

5 The Witness Function Method and Provably Recursive Functions of Peano – Samuel R. Buss - 1994
54 An application of boolean complexity to separation problems in bounded arithmetic – Samuel R. Buss, Jan Krajlcek - 1994
10 Bounded Arithmetic and Propositional Proof Complexity – Samuel R. Buss - 1995
Provably Total Functions in – Bounded Arithmetic Theories, V, Samuel R. Buss, Gaisi Takeuti
18 Structure and Definability in General Bounded Arithmetic Theories – Chris Pollett - 1999
35 Witnessing Functions in Bounded Arithmetic and Search Problems – Mario Chiari, Jan Krajicek - 1994
2 Ordinal Notations and Well-Orderings in Bounded Arithmetic – Arnold Beckmann, Samuel R. Buss, Chris Pollett - 2002
3 Bounded arithmetic, cryptography, and complexity – Samuel R. Buss - 1997
8 Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic – Arnold Beckmann, Samuel R. Buss - 2008
1 Fragments of Approximate Counting – Samuel R. Buss, Leszek Aleks, Neil Thapen - 2012
3 Combinatorics in Bounded Arithmetics – Kerry Ojakian - 2004
8 The provable total search problems of bounded arithmetic – Alan Skelley, Neil Thapen - 2007
3 Bounded Arithmetic and Constant Depth Frege Proofs – Samuel R. Buss - 2004
1 Consistency and Games|in Search of New Combinatorial Principles – Pavel Pudlák - 2004
Approximate counting by hashing in bounded arithmetic – Emil Jerábek - 2008
I of M A T H E M – unknown authors - 2008
1 On the $\Delta^b_1$-Bit-Comprehension Rule – Jan Johannsen, Bit-comprehension Rule, Chris Pollett - 2000
5 On the b 1 -bit-comprehension rule – Jan Johannsen, Chris Pollett - 2000
9 On model theory for intuitionistic bounded arithmetic with applications to independence results – Samuel R. Buss - 1990