Abstract
In the previous chapter, we have seen that under the hypothesis P ≠ NP there are “hierarchies” of incomparable sets between P and the NP-complete sets. In this section we are going to study a very different kind of hierarchy between P and PSPACE: the polynomial time hierarchy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Luis Balcázar, J., Díaz, J., Gabarró, J. (1995). The Polynomial Time Hierarchy. In: Structural Complexity I. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79235-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-79235-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-79237-3
Online ISBN: 978-3-642-79235-9
eBook Packages: Springer Book Archive