Quantifiers, Games, and Interactive Proofs
Johannes Köbler, Uwe Schöning, Jacobo Torán · Birkhäuser Boston eBooks · 1993
We have seen that the complexity class NP can be characterized in terms of an existential quantifier followed by a polynomial time predicate. This idea can be generalized to characterize other complexity classes.