Video Lectures
Lecture 15: NP-Completeness
Description: Quickly reviewed last lecture. Covered NP-completeness; \(SAT\) and \(3SAT\); \(3SAT\) ≤\(_P\) \(HAMPATH\); and \(3SAT\) ≤\(_P\) \(CLIQUE\). Discussed a strategy for proving NP-completeness with a reduction from \(3SAT\) by constructing gadgets that simulate variables and clauses.
Instructor: Prof. Michael Sipser
Course Info
Instructor
As Taught In
Fall
2020
Level
Topics
Learning Resource Types
theaters
Lecture Videos
assignment
Problem Sets
grading
Exams
notes
Lecture Notes
Instructor Insights
