Complexity theory joke: the gap between quasi-poly and polynomial only annoys theorists

davidmanheim · x · 2026-10-28

A playful exchange in the complexity theory corner: RokoMijic quips that the difference between n^(log log log n) and 100+ degree polynomials is just how annoyed theorists get; davidmanheim jokes he'd love a P=NP proof whose construction is lower-bounded by a ridiculous 3- or 4-digit degree polynomial—screaming theorists, no practical impact.

Original post →

More from Fun

Fun channel →