Algorithms for NP-Hard Problems (Section 23.4: The P!=NP Conjecture)

One of the most important open questions in all of computer science and mathematics. Formalizes the idea that checking an alleged solution to a problem can be fundamentally easier than coming up with your own solution from scratch.