Bounded Arithmetic (1986)

by Samuel R. Buss
Citations:64 - 2 self

Documents Related by Co-Citation

110 Feasibly constructive proofs and the propositional calculus – Stephen A Cook - 1975
74 Existence and feasibility in arithmetic – R Parikh - 1971
285 The relative efficiency of propositional proof systems – Stephen A. Cook, Robert, A. Reckhow - 1979
49 Feasible Functions – Yuri Gurevich - 1993
129 The intrinsic computational difficulty of functions – A Cobham - 1964
254 Relational Queries Computable in Polynomial Time – Neil Immerman - 1986
56 Bounded arithmetic and the polynomial hierarchy, APAL 52 – J Krajíček, P Pudlák, G Takeuti - 1991
79 Functional interpretations of feasibly constructive arithmetic – Stephen Cook, Alasdair Urquhart - 1993
77 Counting problems in bounded arithmetic – J Paris, A Wilkie - 1985
117 Exponential lower bounds for the pigeonhole principle – P Beame, R Impagliazzo, J Krajíček, T Pitassi, P Pudlák, A Woods - 1992
78 S.: Fixed-Point Extensions of First-Order Logic – Y Gurevich, Shelah - 1986
212 Languages That Capture Complexity Classes – Neil Immerman - 1987
69 Provability of the pigeonhole principle and the existence of infinitely many primes, JSL 53 – J Paris, A Wilkie, A Woods - 1988
158 A New Recursion-Theoretic Characterization Of The Polytime Functions – Stephen Bellantoni, Stephen Cook - 1992
69 Toward Logic Tailored for Computational Complexity – Yuri Gurevich - 1984
74 Propositional proof systems, the consistency of first order theories and the complexity of computations – Jan Krajíček, Pavel Pudlák - 1989
31 A foundational delineation of computational feasiblity – D Leivant - 1991
13 Inductive definitions over finite structures – D Leivant - 1989
60 Bounded linear logic: a modular approach to polynomial-time computability – Jean-Yves Girard, Andre Scedrov, Phillip Scott - 1992