Algorithm for NP-Hard Problems (Section 19.5: A Simple Recipe for Proving NP-Hardness)
Tim Roughgarden Lectures · 26:07
This companion lecture for *Algorithms Illuminated* Part Four (§19.5) shows how to prove a problem is NP-hard with a two-step recipe: pick a known NP-hard problem *A*, then reduce *A* to the problem *B* you care about...