A New Recursion-Theoretic Characterization Of The Polytime Functions (1992)

Cached

Download Links

by Stephen Bellantoni , Stephen Cook
Venue:COMPUTATIONAL COMPLEXITY
Citations:179 - 7 self

Active Bibliography

45 Predicative Recursion and Computational Complexity – Stephen J. Bellantoni - 1992
3 On Characterizations of the Basic Feasible Functionals Part II – Robert J. Irwin, et al. - 2002
1 Recursion Schemata For Slow Growing Depth Circuit Classes – Satoru Kuroda
5 Sharply Bounded Alternation within P – Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith - 1996
10 Semantics vs. Syntax vs. Computations -- Machine Models For Type-2 . . . – James Royer - 1997
4 Sharply bounded alternation and quasilinear time – Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith - 1998
Feasible Functionals And Intersection Of Ramified Types – Daniel Leivant - 2003
12 Theories With Self-Application and Computational Complexity – Thomas Strahm - 2002
14 Function-algebraic characterizations of log and polylog parallel time – Stephen Bloch - 1994
A Formalization of Polytime Functions – Sylvain Heraud, David Nowak - 2011
6 A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract) – Bruce Kapron, Stephen A. Cook - 1991
4 Weak theories of operations and types – Thomas Strahm
5 On Feasible Numbers – Vladimir Yu. Sazonov - 1995
2 A Quantifier-Free String Theory Alogtime Reasoning – Fran├žois Pitt, Fran├žois Pitt - 2000
50 The History and Status of the P versus NP Question – Michael Sipser, Juris Hartmanis - 1992
On Type-2 Complexity Classes – Chung-chih Li, James S. Royer - 2001
Complexity Theory And Bounded Arithmetic For Truly Feasible Computation – Satoru Kuroda
4 Divide and Conquer in Parallel Complexity and Proof Theory – Stephen Austin Bloch - 1992
10 Ranking primitive recursions: The low grzegorczyk classes revisited – Stephen J. Bellantoni, Karl-heinz Niggl - 1998