Algorithms for NP-Hard Problems (Section 22.3: The Big Picture)
Tim Roughgarden Lectures · 25:06
This companion lecture for *Algorithms Illuminated* Part 4, section 22.3, maps how 19 NP-hard problems will be proved hard via 18 reductions from 3SAT, and it drills the direction of those arrows so tractability and i...