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

Documents Related by Co-Citation

150 The intrinsic computational difficulty of functions – A Cobham - 1964
57 Ramified recurrence and computational complexity I: Word recurrence and poly-time – Daniel Leivant - 1994
93 Computability and Complexity: From a Programming Perspective – N Jones - 1997
69 Linear Types and Non-Size-Increasing Polynomial Time Computation – Martin Hofmann - 1998
15 Predicative recurrence and computational complexity IV: Predicative functionals and poly-space. should be published – D Leivant, J-Y Marion - 1994
16 A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion – Martin Hofmann - 1998
11 Ramification, Modality, and Linearity in Higher Type Recursion – S Bellantoni, K-H Niggl, H Schwichtenberg - 1998
19 Equations for Defining Poly-time Functions – Voukko-Helena Caseiro - 1997
45 Predicative Recursion and Computational Complexity – Stephen J. Bellantoni - 1992
13 Lambda-calculus characterisations of polytime – D Leivant, J-Y Marion
50 Algebras of feasible functions – Yuri Gurevich - 1983
10 Complexité implicite des calculs, de la théorie à la pratique, Habilitation à diriger les recherches, Université Nancy 2 – J-Y MARION - 2000
4 An Equational Characterization of the Poly-time Functions on any Constructor Data Structure – Vuokko-Helena Caseiro, An Equational - 1996
12 Termination proofs with multiset path orderings imply primitive recursive derivation lengths – D Hofbauer - 1992
51 Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 6: Rewrite Systems – N Dershowitz, J-P Jouannaud - 1990
24 The intrinsic computational diculty of functions – A Cobham - 1964
37 Stratified Functional Programs and Computational Complexity – Daniel Leivant - 1993
6 Computation models and function algebras. available electronically under http://thelonius.tcs.informatik.uni-muenchen.de/,clote/Survey.ps.gz – Peter Clote - 1996
11 An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras – Martin Hofmann, Martin Hofmann Darmstadt - 1997