Algorithms for NP-Hard Problems (Section 19.6: Rookie Mistakes)
Tim Roughgarden Lectures · 9:52
NP-hardness is technically precise but widely misused in casual CS talk: five common slips mark you as a beginner (what “NP” means, saying “in NP” for intractable, treating hardness as academic-only, assuming faster h...