Abstract
We introduce and study two classifications refining the polynomial hierarchy. Both extend the difference hierarchy over NP and are analogs of some hierarchies from recursion theory. We answer some natural questions on the introduced classifications, e.g. we extend the result of J.Kadin that the difference hierarchy over NP does not collapse (if the polynomial hierarchy does not collapse).
The work was done at the University of Heidelberg and was supported by the Alexander von Humboldt Foundation. I would like to thank K.Ambos-Spies and B.Borchert for discussions and pointing out to me some literature in complexity theory.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.Ambos-Spies: A note on complete problems for complexity classes. Information Processing Letters, 23, 227–230(1986)
J.L.Balcázar, J.DÃaz, and Gabarró: Structural Complexity I, EATCS Monographs on Theoretical Computer Science, v.11. Berlin: Springer 1988
J.L.Balcázar, J.DÃaz, and Gabarró: Structural Complexity II, EATCS Monographs on Theoretical Computer Science, v.22. Berlin: Springer 1990
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
R.Chang: On the structure of NP-computations under Boolean operators. Ph.D Thesis, Cornell University 1991
K.Kuratowski and A.Mostowski: Set Theory. Amsterdam: North Holland 1967
V.L.Selivanov: Fine hierarchies of arithmetical sets and definable index sets. Trans. Inst. Math., Novosibirsk 12, 165–185(1989) (in Russian)
V.L.Selivanov: Fine hierarchies and definable index sets. Algebra and logic 30, 705–725 (1991) (in Russian, there is an English translation)
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
C.Yap: Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science 26, 287–300(1983)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Selivanov, V.L. (1994). Two refinements of the polynomial hierarchy. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_161
Download citation
DOI: https://doi.org/10.1007/3-540-57785-8_161
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57785-0
Online ISBN: 978-3-540-48332-8
eBook Packages: Springer Book Archive