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
Instructor
As Taught In
Fall
2020
Level
Topics
Learning Resource Types
theaters
Lecture Videos
assignment
Problem Sets
grading
Exams
notes
Lecture Notes
Instructor Insights
Editable Files
