Oracles that compute values

SIAM Journal on Computing

Volumn 26, Issue 4, 1997, Pages 1043-1065

  Fenner, Stephen ^a   Homer, Steven ^b   Ogihara, Mitsunori ^c,d   Selman, Alan ^e  

^a UNIVERSITY OF SOUTHERN MAINE   (United States)

^b BOSTON UNIVERSITY   (United States)

^c University of Rochester   (United States)

^d UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^e the State University of New York   (United States)

Author keywords

Boolean hierarchy; Bounded query classes; Complexity classes; Computational complexity; Multivalued functions; NPMV; Relativized computation

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL METHODS; POLYNOMIALS; SET THEORY;

BOUNDED QUERY CLASSES; MULTIVALUED FUNCTIONS; PARTIAL FUNCTIONS;

COMPUTATIONAL COMPLEXITY;

EID: 0031210221     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793247439     Document Type: Article

References (19)

1. R. BEIGEL, NP-Hard Sets Are P-Superterse unless R = NP, Technical Report 88-04, Department of Computer Science, Johns Hopkins University, Baltimore, MD, 1988.
2. R. BEIGEL, Bounded queries to SAT and the Boolean hierarchy, Theoret. Comput. Sci., 84 (1991), pp. 199-223.
3. H. BUHRMAN, private communication, 1992.
4. S. BUSS AND L. HAY, On truth table reducibility to SAT, Inform. and Comput., 91 (1991), pp. 86-102.
5. R. BOOK, T. LONG, AND A. SELMAN, Quantitative relativizations of complexity classes, SIAM J. Comput., 13 (1984), pp. 461-487.
6. J. CAI, T. GUNDERMANN, J. HARTMANIS, L. HEMACHANDRA, V. SEWELSON, K. WAGNER, AND G. WECHSUNG, The boolean hierarchy I: Structural properties, SIAM J. Comput., 17 (1988), pp. 1232-1252.
7. J. CAI, T. GUNDERMANN, J. HARTMANIS, L. HEMACHANDRA, V. SEWELSON, K. WAGNER, AND G. WECHSUNG, The boolean hierarchy II: Applications, SIAM J. Comput., 18 (1989), pp. 95-111.
8. J. CAI AND L. HEMACHANDRA, The Boolean hierarchy: Hardware over NP, in Structure in Complexity Theory, Lecture Notes in Comput. Sci. 223, Springer-Verlag, Berlin, 1986, pp. 105-124.
9. Z. CHEN AND S. TODA, On the complexity of computing optimal solutions, Internat. J. Found. Comput. Sci., 2 (1991), pp. 207-220.
10. L. HEMASPAANDRA, private communication, 1993.
11. L. HEMASPAANDRA, A. NAIK, M. OGIHARA, AND A. SELMAN, Computing solutions uniquely collapses the polynomial hierarchy, SIAM J. Comput., 25 (1996), pp. 697-708.
12. J. KADIN, The polynomial time hierarchy collapses if the Boolean hierarchy collapses, SIAM J. Comput., 17 (1988), pp. 1263-1282.
13. M. KRENTEL, The complexity of optimization problems, J. Comput. Systems Sci., 36 (1988), pp. 490-509.
14. J. KÖBLER, U. SCHÖNING, AND K. WAGNER, The difference and truth-table hierarchies for NP, RAIRO Inform. Théor. Appl., 21 (1987), pp. 419-435.
15. A. SELMAN, A taxonomy of complexity classes of functions, J. Comput. Systems Sci., 48 (1994), pp. 357-381.
16. E. HEMASPAANDRA, private communication, 1993.
17. H. WAREHAM, On the Computational Complexity of Inferring Evolutionary Trees, Master's thesis, Department of Computer Science, Memorial University of Newfoundland, St. John's, NF, Canada, 1992.
18. O. WATANABE AND S. TODA, Structural analysis of the complexity of inverse functions, Math. Systems Theory, 26 (1993), pp. 203-214.
19. G. WECHSUNG AND K. WAGNER, On the boolean closure of NP, in Proc. International Conference on Fundamentals of Computation Theory, Lecture Notes in Comput. Sci. 199, Springer-Verlag, Berlin, 1985, pp. 485-493.