Refining the polynomial hierarchy

Algebra and Logic

Volumn 38, Issue 4, 1999, Pages 248-258

  Selivanov, V L ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010579734     PISSN: 00025232     EISSN: 15738302     Source Type: Journal    
DOI: 10.1007/BF02671730     Document Type: Review

References (13)

1. V. L. Selivanov, "Two refinements of the polynomial hierarchy," in Lect. Notes Comp. Sc., Vol. 775, Springer, Berlin (1994), pp. 439-448.
2. V. L. Selivanov, "Fine hierarchies and Boolean terms," J. Symb. Log., 60, No. 1, 289-317 (1995).
3. J. Kadin, "The polynomial hierarchy collapses if the Boolean hierarchy collapses," SIAM J. Comp., 17, No. 6, 1263-1282 (1987).
4. V. L. Selivanov, "Hierarchies of hyperarithmetical sets and functions," Algebra Logika, 22, 666-692 (1983).
5. J. Addison, "The method of alternating chains," in The Theory of Models, North Holland, Amsterdam (1965), pp. 1-16.
6. G. Wechsung and K. Wagner, "On the Boolean closure of NP," in Lect. Notes Comp. Sc., Vol. 199, Springer, Berlin (1985), pp. 485-493.
7. J. Köbler, U. Shöning, and K. W. Wagner, "The difference and truth-table hierarchies for NP," Preprint 7, Dep. Informatics, Koblenz (1986).
8. R. Chang, "On the structure of NP-computations under Boolean operators," Ph. D. Thesis, Cornell University (1991).
9. C. Yap, "Some consequences of non-uniform conditions on uniform classes," Theor. Comp. Sc., 26, 287-300 (1983).
10. K. Kuratowski and A. Mostowski, Set Theory, North Holland, Amsterdam (1967).
11. J. L. Balcázar, J. Díaz, and J. Gabarró, Structural Complexity. I, EATCS Monogr. Theor. Comp. Sc., Springer, Berlin (1988).
12. V. L. Selivanov, "Fine hierarchy of regular ω-languages," Theor. Comp. Sc., 191, 37-59 (1998).
13. A. Blass and Y. Gurevich, "Equivalence relations, invariants, and normal forms," in Logic and Machines: Decision Problems and Complexity, Lect. Notes Comp. Sc., Vol. 171, Springer, Berlin (1986), pp. 24-42.