A new Characterization of Type-2 Feasibility
- 1 February 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 25 (1) , 117-132
- https://doi.org/10.1137/s0097539794263452
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Computability and Complexity of Higher Type FunctionsPublished by Springer Nature ,1992
- Complexity for type-$2$ relations.Notre Dame Journal of Formal Logic, 1990
- Characterizations of the Basic Feasible Functionals of Finite TypePublished by Springer Nature ,1990
- Computational complexity of real functionsTheoretical Computer Science, 1982
- Polynomial and abstract subrecursive classesJournal of Computer and System Sciences, 1976