factual

NP-Completeness and Universality of Hard Problems

The big surprise of the early 1970s was NP-completeness: most hard problems in NP have a universality property whereby a polynomial-time algorithm for any one of them would solve every NP problem in polynomial time, so the thousands of practical hard problems (airline scheduling, traveling salesperson, combinatorial optimization, even Super Mario levels) are all equivalent, while factoring is a rare outlier living in a no-man's land between P and NP-complete.

factualpending

Speaker

Scott Aaronson

Evidence Quote

“what NP-completeness means is that you show that your one specific problem has the property that if anyone could solve it in polynomial time, then P would equal NP, then you could solve every NP problem in polynomial thought”

Source

99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity— Sean Carroll's Mindscape
Created: 6/13/2026, 12:26:25 AM

Your notes

Loading notes...