Algorithms for NP-Hard Problems (Section 19.3: Easy and Hard Problems)
Tim Roughgarden Lectures · 22:56
This lecture (Algorithms Illuminated Part 4, §19.3) gives an informal first pass on NP-hardness: an “easy” problem is one solved by some polynomial-time algorithm, while a “hard” (NP-hard) problem is one whose polynom...