MIT
Lecture 4: SAT I
Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathMathematicsEngineering
Om kurset
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.