Video details loaded
HomeMIT 18.404J Theory of Computation, Fall 2020Lecture 18: PSPACE-Completeness
Lecture 18: PSPACE-Completeness
1:17:36
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