Video details loaded
HomeMIT 6.890 Algorithmic Lower Bounds, Fall 2014Lecture 5: SAT Reductions
MIT 6.890 Algorithmic Lower Bounds, Fall 2014
Video 5 of 10
Lecture 5: SAT Reductions
1:21:39
Up Next
Lecture 6: Circuit SAT
Description: In this lecture, Professor Demaine explains hardness proofs of games and puzzles, and graph theoretic problems, all reducing from 3-SAT.
Instructor: Erik Demaine
A video player with synced slides and lecture notes is available.