|
158
|
A New Recursion-Theoretic Characterization Of The Polytime Functions
– Stephen Bellantoni, Stephen Cook
- 1992
|
|
129
|
The intrinsic computational difficulty of functions
– A Cobham
- 1964
|
|
35
|
Classes of predictably computable functions
– R W Ritchie
|
|
53
|
Ramified recurrence and computational complexity I: Word recurrence and polytime
– D Leivant
- 1992
|
|
50
|
Subrecursion: functions and hierarchies
– H Rose
- 1984
|
|
35
|
A New Characterization Of Type 2 Feasibility
– Kapron Cook, S. A. Cook
- 1996
|
|
328
|
On a theory of computation and complexity over the real numbers: NP completeness, recursive functions, and universal machines
– L Blum, M Shub, S Smale
- 1989
|
|
148
|
Complexity Theory of Real Functions
– K Ko
- 1991
|
|
68
|
Recursion Theory on the Reals and Continuous-time Computation
– Cristopher Moore
- 1995
|
|
106
|
Bounded Arithmetic. Bibliopolis
– Samual Buss
- 1986
|
|
43
|
Predicative Recursion and Computational Complexity
– Stephen J. Bellantoni
- 1992
|
|
13
|
Function-algebraic characterizations of log and polylog parallel time
– Stephen Bloch
- 1994
|
|
10
|
Egyszer"u p'elda eld"onthetetlen aritmetikai probl'em'ara, Mates 'es Fizikai Lapok 50
– L Kalmar
- 1943
|
|
18
|
The Expressive Power of Higher-order Types or, Life without CONS
– Neil D. Jones
- 2001
|
|
29
|
An analog characterization of the Grzegorczyk hierarchy
– Manuel Lameiras Campagnolo, Cristopher Moore
- 2002
|
|
9
|
Computability over topological structures
– Vasco Brattka
- 2003
|
|
43
|
Extension de la notion de fonction récursive aux fonctions d’une ou plusiers variables
– D Lacombe
- 1955
|
|
17
|
Efficient First Order Functional Program Interpreter With Time Bound Certifications
– J.-Y. Marion, J.-Y. Moyen
- 2000
|
|
3
|
On the computational complexity of type 2 functionals
– E Pezzoli
- 1998
|
