A note on parallel queries and the symmetric-difference hierarchy

Information Processing Letters

Volumn 66, Issue 1, 1998, Pages 13-20

  Wagner, Klaus W ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Boolean hierarchy; Parallel queries; Plus hierarchy; Query order; Symmetric difference hierarchy

Indexed keywords

EID: 0009156670     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00024-6     Document Type: Article

References (26)

1. R.J. Beigel, R. Chang, Commutative queries, in: Proc. 5th Israeli Symposium on Theory of Computing and Systems, IEEE Computer Society Press, 1997, pp. 159-165.
2. R.J. Beigel, R. Chang, M. Ogiwara, A relationship between difference hierarchies and relativized polynomial hierarchies, Math. Systems Theory 26 (1993) 293-310.
3. R.J. Beigel, Bounded queries to SAT and the boolean hierarchy. Theoret. Comput. Sci. 84 (1991) 199-223.
4. H. Buhrmann, L. Fortnow, Two queries, TR 96-20, University of Chicago, Department of Computer Science, 1996.
5. S.R. Buss, L. Hay, On truth-table reducibility to SAT and the difference hierarchy over NP, in: Proc. 3rd IEEE Conference on Structure in Complexity Theory, IEEE Computer Society Press, 1988, pp. 224-233.
6. J.-Y. Cai, T. Gundermann, J. Hartmanis, L.A. Hemachandra, V. Sewelson, K.W. Wagner, G. Wechsung, The boolean hierarchy I: Structural properties, SIAM J. Comput. 17 (1988) 1232-1252.
7. J.-Y. Cai, L.A. Hemachandra, The Boolean hierarchy: hardware over NP, in: Proc. 1st Structure in Complexity Theory, Lecture Notes in Comput. Sci., Vol. 223, Springer, Berlin, 1986, pp. 105-124.
8. R. Chang, Bounded queries, approximation and the boolean hierarchy, TR CS 97-04, University of Maryland, Department of Computer Science and Electrical Engineering, 1997.
9. L.A. Hemaspaandra, E. Hemaspaandra, H. Hempel, A downward translation in the polynomial hierarchy, in: Proc. 14th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci., Vol. 1200, Springer, Berlin, pp. 319-328; also: SIAM J. Comput. (1997).
10. L.A. Hemaspaandra, E. Hemaspaandra, H. Hempel, A downward translation in the polynomial hierarchy, in: Proc. 14th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci., Vol. 1200, Springer, Berlin, pp. 319-328; also: SIAM J. Comput. (1997).
11. L.A. Hemaspaandra, E. Hemaspaandra, H. Hempel, Query order in the polynomial hierarchy, in: Proc. 11th Fundamentals of Computer Science Conference, Lecture Notes in Comput. Sci., Vol. 1279, Springer, Berlin, 1997, pp. 222-232.
12. L.A. Hemaspaandra, E. Hemaspaandra, H. Hempel, Translating equality downwards, TR 657, University of Rochester, Department of Computer Science, 1997.
13. L.A. Hemaspaandra, E. Hemaspaandra, G. Wechsung, Query order, SIAM J. Comput., to appear.
14. J. Köbler, Untersuchungen verschiedener polynomieller Reduktionsklassen von NP, Diploma Thesis, Universität Stuttgart, 1985.
15. M.W. Krentel, The complexity of optimization problems, in: Proc. of 18th Annual Symposium on Theory of Computing, Association for Computing Machinery, 1986, pp. 69-76.
16. J. Köbler, U. Schöning, K.W. Wagner, The difference and the truth table hierarchies for NP, R.A.I.R.O. Theoretical Informatics and Applications 21 (1987) 419-435.
17. A.R. Meyer, L.J. Stockmeyer, The equivalence problem for regular exressions with squaring requires exponential space, in: Proc. of 13th Annual IEEE Symposium on Switching and Automata Theory, 1972, pp. 125-129.
18. C.H. Papadimitriou, S. Zachos, Two remarks on the power of counting, in: Proc. of 6th GI Conference on Theoretical Computer Science, Lecture Notes in Comput. Sci., Vol. 145, Springer, 1983, pp. 269-275.
19. S. Reith, K.W. Wagner, On boolean lowness and boolean highness, Manuscript, Universität Würzburg, Institut für Informatik, 1998.
20. V.L. Selivanov, Two refinements of the polynomial hierarchy, in: Proc. of 11th STAGS Conference, Lecture Notes in Comput. Sci., Vol. 775, Springer, 1994, pp. 439-448.
21. V.L. Selivanov, Extending the difference hierarchy over NP, Manuscript, 1995.
22. L.J. Stockmeyer, The polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1977) 1-22.
23. K.W. Wagner, More complicated questions about maxima and minima, and some closures of NP, Theoret. Comput. Sci. 51 (1987) 53-80.
24. K.W. Wagner, Bounded query classes. SIAM J. Comput. 19 (1990) 833-846.
25. G. Wechsung, K.W. Wagner, On the boolean closure of NP, manuscript. Extended abstract as: Wechsung, G., On the boolean closure of NP, in: Proc. of the Conference of Foundations on Computation Theory, Lecture Notes in Comput. Sci., Vol. 199, Springer, 1985, 485-493.
26. G. Wechsung, K.W. Wagner, On the boolean closure of NP, manuscript. Extended abstract as: Wechsung, G., On the boolean closure of NP, in: Proc. of the Conference of Foundations on Computation Theory, Lecture Notes in Comput. Sci., Vol. 199, Springer, 1985, 485-493.