15453 Formal Languages, Automata, and Computation
Lecture 38: PSPACECompleteness
We define and analyze the notion of PSPACEcompleteness, which is
analogous to NPcompleteness and also based on polynomial time
reductions. A particularly important PSPACEcomplete problem
is TQBF, which requires us to decide if a quantified Boolean
formula is true.
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
