NP-Completeness (Fundamental Algorithms, Spring 2022, Lecture 10)
Kent Quanrud · 62:09
The lecture argues that SAT, Circuit SAT, Independent Set, and a huge class of other search problems are equivalent up to polynomial-time reductions: a poly-time algorithm for any one of them would give a (messier but...