Query order in the polynomial hierarchy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1279, Issue , 1997, Pages 222-232

  Hemaspaandra, Edith ^a   Hemaspaandra, Lane A ^b   Hempel, Harald ^c  

^a LE MOYNE COLLEGE   (United States)

^b University of Rochester   (United States)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

INFORMATION SOURCES; POLYNOMIAL HIERARCHIES; POLYNOMIAL-TIME; QUERY CLASS;

C (PROGRAMMING LANGUAGE);

EID: 84958748681     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0036186     Document Type: Conference Paper

References (20)

1. M. Agrawal, R. Beigel, and T. Thierauf. Pinpointing computation with modular queries in the boolean hierarchy. In Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 322-334. Springer-Verlag Lecture Notes in Computer Science #1180, December 1996.
2. D. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice Hall, 1993.
3. R. Beigel and R. Chang. Commutative queries. In Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems. IEEE Computer Society Press, June 1997. To appear.
4. R. Beigel, R. Chang, and M. Ogiwara. A relationship between difference hierarchies and relativized polynomial hierarchies. Mathematical Systems Theory, 26:293-310, 1993.
5. J. Balcázar, J. Diaz, and J. Gabarro. Structural Complexity I. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, 2nd edition, 1995.
6. J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The boolean hierarchy I: Structural properties. SIAM Journal on Computing, 17(6):1232-1252, 1988.
7. R. Chang and J. Kadin. The boolean hierarchy and the polynomial hierarchy: A closer connection. SIAM Journal on Computing, 25(2):340-354, 1996.
8. L. Fortnow and N. Reingold. PP is closed under truth-table reductions. In Proceedings of the 6th Structure in Complexity Theory Conference, pages 13-15. IEEE Computer Society Press, June/July 1991.
9. U. Hertrampf. Acceptance by transformation monoids (with an application to local self-reductions). In Proceedings of the 12th Annual IEEE Conference on Computational Complexity. IEEE Computer Society Press, June 1997. To appear.
10. E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. Query order in the polynomial hierarchy. Technical Report TR-634, University of Rochester, Department of Computer Science, Rochester, NY, September 1996.
11. E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. A downward translation in the polynomial hierarchy. In Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, pages 319-328. Springer-Verlag Lecture Notes in Computer Science #1200, February/March 1997.
12. 1-tt(NP) distinguishes robust many-one and Turing completeness. In Proceedings of the 3rd Italian Conference on Algorithms and Complexity, pages 49-60. Springer-Verlag Lecture Notes in Computer Science #1203, March 1997.
13. E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. Translating equality downwards. Technical Report TR-657, University of Rochester, Department of Computer Science, Rochester, NY, April 1997.
14. L. Hemaspaandra, H. Hempel, and G. Wechsung. Query order. SIAM Journal on Computing. To appear.
15. J. Kadin. The polynomial time hierarchy collapses if the boolean hierarchy collapses. SIAM Journal on Computing, 17(6):1263-1282, 1988. Erratum appears in the same journal, 20(2):404.
16. J. Köhler, U. Schöning, and K. Wagner. The difference and truth-table hierarchies for NP. RAIRO Theoretical Informatics and Applications, 21:419-435, 1987.
17. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
18. V. Selivanov. Two refinements of the polynomial hierarchy. In Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, pages 439-448. Springer-Verlag Lecture Notes in Computer Science #775, February 1994.
19. K. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833-846, 1990.
20. K. Wagner. A note on parallel queries and the difference hierarchy (draft). Manuscript, February 3, 1997.