18.404J | Fall 2020 | Undergraduate, Graduate

Theory of Computation

Video Lectures

Lecture 17: Space Complexity, PSPACE, Savitch's Theorem

Description: Quickly reviewed last lecture. Introduced space complexity. Defined SPACE\((f(n))\), NSPACE\((f(n))\), PSPACE, and NPSPACE. Proved \(TQBF\) ∈ PSPACE, \(LADDER_\bf{DFA}\) ∈ NSPACE(\(n\)), and \(LADDER_\bf{DFA}\) ∈ SPACE(\(n^2\)).

Instructor: Prof. Michael Sipser

Course Info

Learning Resource Types
Lecture Videos
Problem Sets
Exams
Lecture Notes
Instructor Insights