ConceptTheory & Algos
PSPACE-completeness
A problem is PSPACE-complete if it is in PSPACE and every problem in PSPACE can be polynomial-time reduced to it.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Michael Sipser
A language is PSPACE-complete if is in PSPACE and every language in PSPACE is polynomial-time reducible to .
Lectures that assume it
3Connections
12The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Polynomial time reduction
- PSPACE
- NP-completeness
- Polynomial time reducibility
- TQBF
- Geography game graph construction