Algorithms for NP-Hard Problems (Section 23.3: NP: Problems with Easily Recognized Solutions)
Tim Roughgarden Lectures · 24:58
NP is the class of search problems whose candidate solutions are polynomially short and polynomially checkable; that is exactly what makes them solvable by naive exhaustive search, and it is the right “everything we m...