15-453 Formal Languages, Automata, and Computation
Lecture 38: PSPACE-Completeness
We define and analyze the notion of PSPACE-completeness, which is
analogous to NP-completeness and also based on polynomial time
reductions. A particularly important PSPACE-complete problem
is TQBF, which requires us to decide if a quantified Boolean
formula is true.