The Polynomial Time Hierarchy
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.
Unable to display preview. Download preview PDF.