ConceptTheory & Algos
Savitch's theorem
A theorem stating that any problem solvable by a non-deterministic Turing machine in space is solvable by a deterministic Turing machine in space.
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.
Space complexity5Turing machine3Non-deterministic Turing machine2Configuration1Deterministic space classes1Deterministic space complexity1Non-determinism1Non-deterministic space complexity1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Ryan O'Donnell
A theorem stating that deterministic space complexity classes are closed under squaring, specifically that ST-PATH can be solved in space.Michael Sipser
Lectures that assume it
2Connections
15The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Space complexity
- Turing machine
- Non-deterministic Turing machine
- Configuration
- NSPACE hierarchy
- PSPACE and NPSPACE equality