18.404J | Fall 2020 | Undergraduate, Graduate

Theory of Computation

Video Lectures

Lecture 18: PSPACE-Completeness

Description: Quickly reviewed last lecture. Proved Savitch’s Theorem: NSPACE\((f(n))\) ⊆ SPACE\((f^2 (n))\). Also proved PSPACE-completeness and \(TQBF\) is PSPACE-complete.

Instructor: Prof. Michael Sipser

Course Info

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