Algorithms for NP-Hard Problems (Section 22.7: Subset Sum Is NP-Hard)
Tim Roughgarden Lectures · 26:24
Subset Sum looks like a trivial numbers problem, but this lecture proves it NP-hard by reducing Independent Set to it with carefully constructed exponential-size integers—and because Subset Sum is a special case of kn...