Algorithm for NP-Hard Problems (Section 19.5: A Simple Recipe for Proving NP-Hardness)
How can you recognize NP-hard problems when they come up in your own work, so that you can adjust your ambitions accordingly and abandon the search for an algorithm that is general-purpose, correct, and fast? Nobody wins if you spend weeks or months of your life inadvertently trying to refute the “P!=NP” conjecture.
Accompanies Section 19.5 of the book Algorithms Illuminated, Part 4: Algorithms for NP-Hard Problems. (http://www.algorithmsilluminated.org/)
Full playlist: • Algorithms Illuminated, Part 4: Algor...