Functions computable with nonadaptive queries to NP

Theory of Computing Systems

Volumn 31, Issue 1, 1998, Pages 77-92

  Buhrman, H ^a   Kadin, J ^b   Thierauf, T ^c  

^a CWI   (Netherlands)

^b University of Maine   (United States)

^c UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; POLYNOMIAL APPROXIMATION;

FUNCTION CLASS; NP COMPLETE; OPTIMAL VALUES; OPTIMIZATION FUNCTION; OPTIMIZATION PROBLEMS; PARALLEL QUERIES; POLYNOMIAL-TIME; SEQUENTIAL ACCESS;

OPTIMIZATION;

EID: 0032330820     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000079     Document Type: Article

References (18)

1. M. Agrawal and S. Biswas. Universal Relations. In Proc. 7th Structure in Complexity Theory Conference, pages 207-220, 1992. To appear in Information and Computation.
2. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, Berlin, 1988.
3. R. Book, T. Long, and A. Selman. Quantitative Relativizations of Complexity Classes. SIAM Journal on Computing 13(3):461-487, 1984.
4. S. Cook. The Complexity of Theorem-Proving Procedures. In Proc. 3rd ACM Symposium on Theory of Computing, pages 151-158, 1971.
5. Z. Chen and S. Toda. On the Complexity of Computing Optimal Solutions. International Journal of Foundations of Computer Science 2:207-220, 1991.
6. ∥. Manuscript, 1993.
7. S. Fenner, S. Homer, M. Ogiwara, and A. Selman. On Using Oracles that Compute Values. In Proc. 10th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 398-407, 1993. To appear in SIAM Journal on Computing.
8. J. Grollmann and A. Selman. Complexity Measures for Public-Key Cryptosystems. SIAM Journal on Computing 17:309-335, 1988.
9. L. Hemaspaandra, A. Naik, M. Ogihara, and A. Selman. Computing Solutions Uniquely Collapes the Polynomial Hierarchy. In Algorithms and Computation, International Symposium ISAAC '94, pages 56-64. LNCS 834. Springer-Verlag, Berlin, 1994. Also in SIAM Journal on Computing 45:597-608, 1996.
10. L. Hemaspaandra, A. Naik, M. Ogihara, and A. Selman. Computing Solutions Uniquely Collapes the Polynomial Hierarchy. In Algorithms and Computation, International Symposium ISAAC '94, pages 56-64. LNCS 834. Springer-Verlag, Berlin, 1994. Also in SIAM Journal on Computing 45:597-608, 1996.
11. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979.
12. B. Jenner and J. Torán. Computing Functions with Parallel Queries to NP. Theoretical Computer Science 141:175-193, 1995.
13. M. Krentel. The Complexity of Optimization Problems. Journal of Computer and System Sciences 36(3):761-767, 1988.
14. M. Ogihara. Functions Computable with Limited Access to NP. Information Processing Letters 58:35-38, 1996.
15. A. Selman. A Taxonomy of Complexity Classes of Functions. Journal of Computer and System Science 48:357-381, 1994.
16. S. Toda. The Complexity of Finding Medians. Proc. 31st IEEE Annual Symposium on Foundations of Computer Science, pages 778-787, 1990.
17. L. Valiant. The Relative Complexity of Checking and Evaluating. Information Processing Letters 5:20-23, 1976.
18. O. Watanabe and S. Toda. Structural Analysis on the Complexity of Inverse Functions. Mathematical Systems Theory 26:203-214, 1993.