A Tight Relationship between Generic Oracles and Type-2 Complexity Theory

Information and Computation

Volumn 137, Issue 2, 1997, Pages 159-170

  Cook, Stephen ^a   Impagliazzo, Russell ^b   Yamakami, Tomoyuki ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012673505     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2646     Document Type: Article

References (31)

1. Baker, T. J., Gill, J., and Solovay, R. (1975), Relativizations of the P = ?NP question, SIAM J. Computing 4, 431-442.
2. Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., and Pitassi, T. (1995), The relative complexity of NP search problems, in "Proceedings, 27th ACM Symposium on Theory of Computing," pp. 303-314; J. Comput. Sys. Sci. To appear.
3. Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., and Pitassi, T. (1995), The relative complexity of NP search problems, in "Proceedings, 27th ACM Symposium on Theory of Computing," pp. 303-314; J. Comput. Sys. Sci. To appear.
4. Blum, M., and Impagliazzo, R. (1987), Generic oracles and oracle classes, in "Proceedings, 28th IEEE Symposium on Foundations of Computer Science," pp. 118-126.
5. Cohen, P. (1963, 1964), The independence of the continuum hypothesis, I, II, Proc. Natl. Acad. Sci. U.S.A. 50, 1143-1148 51, 105-110.
6. Constable, R. L. (1973), Type two computable functionals, in "Proceedings, 5th ACM Symposium on Theory of Computing," pp. 108-121.
7. Cook, S. (1971), The complexity of theorem-proving procedures, in "Proceedings 3rd ACM Symposium on Theory of Computing," pp. 151-158.
8. Cook, S., and Urquhart, A. (1993), Functional interpretations of feasibly constructive arithmetic, Ann. Pure Appl. Logic 63, 103-200.
9. Fenner, S., Fortnow, L., Kurtz, S. A., and Li, L. (1993), An oracle builder's toolkit, in "Proceedings, 8th IEEE Conference on Structure in Complexity Theory," pp. 120-131.
10. Fortnow, L., and Sipser, M. (1988), Are there interactive protocols for co-NP languages? Inform. Process. Lett. 28, 249-251.
11. Fortnow, L., and Yamakami, T. (1996), Generic separations, J. Comput. System Sci. 52, 191-197.
12. Furst, M., Saxe, J. B., and Sipser, M. (1984), Parity, circuits, and the polynomial time hierarchy, Math. Systems Theory 17, 13-27.
13. Harnik, V. (1992), Provably total functions of intuitionistic bounded arithmetic, J. Symbolic Logic 57, 466-477.
14. Hartmanis, J., and Hemachandra, L. A. (1987), One-way functions, robustness, and the nonisomorphism of NP-complete sets, in "Proceedings, 2nd Conference on Structure in Complexity Theory," pp. 160-174.
15. Hartmanis, J., and Hemachandra, L. A. (1990), Robust machines accept easy sets, Theoret. Comput. Sci. 74, 217-225.
16. Impagliazzo, R., and Naor, M. (1988), Decision trees and downward closures, in "Proceedings, 3rd IEEE Conference on Structure in Complexity Theory," pp. 29-38.
17. Kaltofen, E., and Trager, B. (1990), Computing with polynomials give by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators, J. Symbolic Comput. 9, 301-320.
18. Kapron, B. M., and Cook, S. A. (1996), A new characterization of type-2 feasibility, SIAM J. Comput. 25, 117-132.
19. Ko, K. (1985), On some natural complete operators, Theoret. Comput. Sci. 37, 1-30.
20. Lund, C., Fortnow, L., Karloff, H., and Nisan, N. (1992), Algebraic methods for interactive proof systems, J. Assoc. Comput. Mach. 39, 859-868.
21. Mehlhorn, K. (1976), Polynomial and abstract subrecursive classes, J. Comput. System. Sci. 12, 147-178.
22. Papadimitriou, C. H. (1990), On graph-theoretic lemmata and complexity classes, in "Proceedings, 31st Symposium on Foundations of Computer Science," pp. 794-801.
23. Poizat, B. (1986), script Q sign = script N sign script Q sign?, J. Symbolic Logic 51, 22-32.
24. Rackoff, C. (1982), Relativized questions involving probabilistic algorithms, J. Assoc. Comput. Mach. 29, 261-268.
25. Shamir, A. (1991), IP = PSPACE, J. Assoc. Comput. Mach. 39, 869-877.
26. Sipser, M. (1983), Borel sets and circuit complexity, in "Proceedings, 15th ACM Symposium on Theory of Computing," pp. 61-69.
27. A by random oracle A? Combinatorica 9, 385-392.
28. Townsend, M. (1990), Complexity for type-2 relations, Notre Dame J. Formal Logic 31, 241-262.
29. Yamakami, T. (1995), Feasible computability and resource bounded topology, Inform. Comput. 116, 214-230.
30. Yamakami, T. (1992), Structural properties for feasibly computable classes of type two, Math. Systems Theory 25, 177-201.
31. Yao, A. (1985), Separating the polynomial-time hierarchy by oracles, in "Proceedings, 26th IEEE Symposium on Foundations of Computer Science," pp. 1-10.