MIT

Lecture 5: SAT Reductions

Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathMathematicsEngineering

Om kurset

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.