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

Cached

Download Links

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

Documents Related by Co-Citation

151 The Intrinsic Computational Difficulty of Functions – - 1965
57 Ramified recurrence and computational complexity I: Word recurrence and poly-time – - 1994
94 Computability and Complexity from a Programming Perspective – - 1997
15 Predicative recurrence and computational complexity IV: Predicative functionals and poly-space. should be published – - 1994
70 Linear Types and Non-Size-Increasing Polynomial Time Computation – - 1998
16 A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion – - 1998
11 Ramification, Modality, and Linearity in Higher Type Recursion – - 1998
19 Equations for Defining Poly-time Functions – - 1997
45 Predicative Recursion and Computational Complexity – - 1992
13 Lambda-calculus characterisations of polytime
50 Algebras of feasible functions – - 1983
10 Complexité implicite des calculs, de la théorie à la pratique, Habilitation à diriger les recherches, Université Nancy 2 – - 2000
4 An Equational Characterization of the Poly-time Functions on any Constructor Data Structure – - 1996
12 Termination proofs with multiset path orderings imply primitive recursive derivation lengths – - 1992
52 Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems – - 1990
24 The intrinsic computational diculty of functions – - 1964
6 Computation models and function algebras. available electronically under http://thelonius.tcs.informatik.uni-muenchen.de/,clote/Survey.ps.gz – - 1996
11 An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras – - 1997
21 Ramified recurrence and computational complexity II: Substitution and poly-space – - 1994