Algorithms for NP-Hard Problems (Section 23.6: NP-Completeness)
Tim Roughgarden Lectures · 19:18
NP-completeness is a stricter form of NP-hardness: an NP-complete problem is a search problem in NP such that every other problem in NP is a thinly disguised special case of it, via a Levin reduction (preprocess the i...