Algorithms for NP-Hard Problems (Section 22.1: Reductions Revisited)
Tim Roughgarden Lectures · 9:23
This lecture is the setup for Chapter 22 of *Algorithms Illuminated* Part 4: after Chapters 20–21 taught how to *attack* a problem already labeled NP-hard (level 2), this chapter trains you to *recognize* NP-hardness...