Pinpointing computation with modular queries in the boolean hierarchy

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

Volumn 1180, Issue , 1996, Pages 322-334

  Agrawal, Manindra ^a   Beigel, Richard ^b   Thierauf, Thomas ^c  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b Yale University   (United States)

^c UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING;

EID: 84947918302     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62034-6_60     Document Type: Conference Paper

References (11)

1. [BDG88] J. Balcázar, J. Diaz, and J. Gabarró. Structural Complexity I. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, 1988.
2. [Bei91] R. Beigel. Bounded queries to SAT and the boolean hierarchy. Theoretical Computer Science, 84:199-223, 1991.
3. [CGH+88] 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.
4. [HT95] T. Han and T. Thierauf. In Proceedings of the 10th Conference in Structure in Complexity Theory, pages 206-213, 1995.
5. [HU79] J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
6. [KSW87] J. Köbler, U. Schöning, and K. Wagner. The difference and truth-table hierarchies of NP. R.A.I.R.O. Informatique théorique et' Applications, 21(4):419-435, 1987.
7. [KT94] J. Köbler and T. Thierauf. Complexity-restricted advice functions. SIAM Journal on Computing, 23(2):261-275, 1994.
8. [LLS75] R. Ladner, N. Lynch, and A. Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science, 1(2): 103-124, 1975.
9. [W90] K. Wagner. Bounded query classes. SIAM J. on Computing 19(5), pages 833-846, 1990.
10. [Wec85] G. Wechsung. On the boolean closure of NP. In Proceedings of the 5th Conference on Fundamentals of Computation Theory, pages 485-493. Springer-Verlag
11. Lecture Notes in Computer Science #199, 1985. (An unpublished precursor of this paper was coauthored by K. Wagner).