Predicative Recursion and Computational Complexity (1992)

Cached

Download Links

by Stephen J. Bellantoni
Citations:45 - 3 self

Active Bibliography

10 Bounded Arithmetic and Propositional Proof Complexity – Samuel R. Buss - 1995
6 Relating the Provable Collapse of P to NC¹ and the Power of Logical Theories – Stephen Cook
35 Witnessing Functions in Bounded Arithmetic and Search Problems – Mario Chiari, Jan Krajicek - 1994
6 A Fundamental Problem of Mathematical Logic – Jan Krajicek
5 On Feasible Numbers – Vladimir Yu. Sazonov - 1995
10 On Bounded Set Theory – Vladimir Yu. Sazonov
21 The complexity of propositional proofs – Nathan Segerlind
179 A New Recursion-Theoretic Characterization Of The Polytime Functions – Stephen Bellantoni, Stephen Cook - 1992
9 Tailoring Recursion for Complexity – Erich Grädel, Yuri Gurevich - 1995
Weak Pigeonhole Principle, and Randomized Computation – Emil Jerábek - 2005
12 Theories With Self-Application and Computational Complexity – Thomas Strahm - 2002
50 The History and Status of the P versus NP Question – Michael Sipser, Juris Hartmanis - 1992
4 Count(q) versus the Pigeon-Hole Principle – Søren Riis - 1996
30 Theories for Complexity Classes and their Propositional Translations – Stephen Cook - 2004
105 The Complexity Of Propositional Proofs – Alasdair Urquhart - 1995
3 Computing on Structures – Serge Abiteboul, Victor Vianu
36 Fixpoint Logics, Relational Machines, and Computational Complexity – Serge Abiteboul, Moshe Y. Vardi, Victor Vianu - 1993
3 Combinatorics in Bounded Arithmetics – Kerry Ojakian - 2004
86 Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic – Jan Krajícek