Classes beyond NP
In this chapter we describe classes of complexity which contain the class NP by generalizing the notion of non-deterministic acceptance. We define the polynomial hierarchy PH, included in the class PSPACE.
KeywordsTuring Machine Computation Tree Universal State Polynomial Hierarchy Probabilistic Turing Machine
Unable to display preview. Download preview PDF.