Video details loaded
HomeMIT 6.890 Algorithmic Lower Bounds, Fall 2014Lecture 7: Planar SAT
MIT 6.890 Algorithmic Lower Bounds, Fall 2014
Video 7 of 10
Lecture 7: Planar SAT
1:23:03
Up Next
Lecture 8: Hamiltonicity
Description: In this lecture, Professor Demaine introduces planar versions of 3SAT, proving these versions are NP-hard.
Instructor: Erik Demaine
A video player with synced slides and lecture notes is available.