Algorithms for NP-Hard Problems (Section 23.4: The P!=NP Conjecture)
Tim Roughgarden Lectures · 12:05
This lecture formally defines the P ≠ NP conjecture for *Algorithms Illuminated* Part 4, §23.4: NP is the class of search problems with efficiently recognizable solutions, P is the subclass of those that can also be s...