A new recursion-theoretic characterization of the polytime functions
- 1 June 1992
- journal article
- Published by Springer Nature in computational complexity
- Vol. 2 (2) , 97-110
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A new recursion-theoretic characterization of the polytime functions (extended abstract)1992
- Computability and Complexity of Higher Type Functions1992
- Arithmetizing Uniform NCAnnals of Pure and Applied Logic, 1991
- Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k , NC k and NC1990
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- Predicative Arithmetic. (MN-32)1986
- Exponential time and bounded arithmetic1986
- Algebras of feasible functions1983
- Feasibly constructive proofs and the propositional calculus (Preliminary Version)1975
- Classes of predictably computable functionsTransactions of the American Mathematical Society, 1963