On the Expressive Power of Existential Quantification in Polynomial-Time Computability

Cached

Download Links

by Dieter Spreen

Active Bibliography

3 On Characterizations of the Basic Feasible Functionals Part II – Robert J. Irwin, et al. - 2002
4 Sharply bounded alternation and quasilinear time – Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith - 1998
1 Safe Weak Minimization Revisited – Dieter Spreen - 2002
2 Minimization and NP multifunctions – N. Danner, C. Pollett - 2000
5 Sharply Bounded Alternation within P – Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith - 1996
Light Affine Logic: Proof Nets, Programming Notation, P-Time Correctness And Completeness – Andrea Asperti , Luca Roversi
56 Light Affine Logic – A. Asperti - 1998
3 Adventures in time and space – Norman Danner, James, S. Royer - 2006
Linear Logic by Levels and Bounded Time Complexity – Patrick Baillot, Damiano Mazza - 2009
1 A New "Feasible" Arithmetic – S. Bellantoni, Martin Hofmann - 2000
1 On superlinear lower bounds in complexity theory – Kenneth W. Regan - 1995
7 Complements of Multivalued Functions – Stephen Fenner, Frederic Green , Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer - 1996
The Complexity of Equivalence Relations – Joshua A. Grochow - 2008
35 Inverting Onto Functions – Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers - 1996
16 Functions Computable with Nonadaptive Queries to NP – Harry Buhrman, Jim Kadin, Thomas Thierauf - 1994
12 Complexity-Restricted Advice Functions РJohannes Köbler, Johannes K, Thomas Thierauf
4 On the ubiquity of certain total type structures – John Longley - 2007
10 Bounded Arithmetic and Propositional Proof Complexity – Samuel R. Buss - 1995
11 Choice and uniformity in weak applicative theories – Andrea Cantini - 2005