Two refinements of the polynomial hierarchy

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

Volumn 775 LNCS, Issue , 1994, Pages 439-448

  Selivanov, Victor L ^a,b  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DIFFERENCE HIERARCHIES; POLYNOMIAL HIERARCHIES; RECURSION THEORY;

POLYNOMIALS;

EID: 84974720768     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57785-8_161     Document Type: Conference Paper

References (10)

1. K. Ambos-Spies: A note on complete problems for complexity classes. Information Processing Letters, 23, 227-230(1986)
2. J.L. Balcázar, J. Díaz, and Gabarró: Structural Complexity I, EATCS Monographs on Theoretical Computer Science, v.11. Berlin: Springer 1988
3. J.L. Balcázar, J. Díaz, and Gabarró: Structural Complexity II, EATCS Monographs on Theoretical Computer Science, v.22. Berlin: Springer 1990
4. A. Blass and Y. Gurevich: Equivalence relations, invariants, and normal forms. In: Logic and Machines: Decision Problems and Complexity. Lecture Notes in Computer Science 171. Berlin: Springer 1986, pp. 24-42
5. R. Chang: On the structure of NP-computations under Boolean operators. Ph.D Thesis, Cornell University 1991
6. K. Kuratowski and A. Mostowski: Set Theory. Amsterdam: North Holland 1967
7. V.L. Selivanov: Fine hierarchies of arithmetical sets and definable index sets. Trans. Inst. Math., Novosibirsk 12, 165-185(1989) (in Russian)
8. V.L. Selivanov: Fine hierarchies and definable index sets. Algebra and logic 30, 705-725 (1991) (in Russian, there is an English translation)
9. K. Wagner and G. Wechsung: On the Boolean closure of NP. In: Proceedings of the 1985 Int. Conf. on Fundamentals of Computation theory. Lecture Notes in Computer Science 199. Berlin: Springer 1985, pp. 485-493
10. C. Yap: Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science 26, 287-300(1983)