Video details loaded
HomeMIT 6.890 Algorithmic Lower Bounds, Fall 2014Lecture 4: SAT I
MIT 6.890 Algorithmic Lower Bounds, Fall 2014
Video 4 of 10
Lecture 4: SAT I
1:20:32
Up Next
Lecture 5: SAT Reductions
Description: In this lecture, Professor Demaine starts a series of lectures on satisfiability, including using SAT to prove NP-hardness.
Instructor: Erik Demaine
A video player with synced slides and lecture notes is available.
