Feasibly continuous type-two functionals

Computational Complexity

Volumn 8, Issue 2, 1999, Pages 188-201

  Kapron, Bruce M ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Continuous functionals; Decision trees; Type two poly time

Indexed keywords

EID: 0033479357     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s000370050027     Document Type: Article

References (14)

1. M. BLUM AND R. IMPAGLIAZZO, Generic oracles and oracle classes, in Proc. 28th Ann. IEEE Symp. Found. Comput. Sci., 1987, 118-126.
2. R. CONSTABLE, Type 2 computational complexity, in Proc. 5th Ann. ACM Symp. Theor. Comput., 1973, 108-121.
3. S. A. COOK, Computability and complexity of higher type functions, in Logic from Computer Science, ed. Y. N. MOSCHOVAKIS, Springer-Verlag, 1991, 51-72.
4. S. A. COOK AND B. M. KAPRON, Characterizations of the basic feasible functionals of finite type, in Feasible Mathematics, ed. S. BUSS AND P. J. SCOTT, Birkhäuser, 1990, 71-93.
5. J. HARTMANIS AND L. A. HEMACHANDRA, Robust machines accept easy sets, Theoret. Comput. Sci., 74 (1990), 217-225.
6. R. IMPAGLIAZZO AND M. NAOR, Decision trees and downward closures, in Proc. 3rd Ann. IEEE Struct. Complexity Theor., 1988, 29-38.
7. B. M. KAPRON, Feasible Computation in Higher Types, PhD. Thesis, Department of Computer Science, University of Toronto, 1991.
8. B. M. KAPRON AND S.A. COOK, A new characterization of type-2 feasibility, SIAM J. Comput., 25 (1996), 117-132.
9. K. MEHLHORN, Polynomial and abstract subrecursive classes, J. Comput. System Sci., 12 (1976), 147-178.
10. H. ROGERS, Theory of Recursive Functions and Effective Computability, MIT Press, Cambridge, 1987.
11. J. S. ROYER, Semantics vs. syntax vs. computations: machine models for type-2 polynomial-time bounded functionals, Proc. 10th Ann. IEEE Struct. Complexity Theor., 1995, 37-48.
12. J.S. ROYER, personal communication, 1996.
13. A by a random oracle?, Combinatorica, 9, (1989), 385-392.
14. M. TOWNSEND, Complexity for type-2 relations, Notre Dame J. Formal Logic, 31 (1990), 241-262.