Intuition: P≠NP would likely be O(n^logn) avg-case and practically useless

tokenbender · x · 2026-11-22

tokenbender shares his intuition on P vs NP: even if we prove P≠NP, the result would likely be something like O(n^logn) average-case runtime—still computationally infeasible in practice.

He predicts a hollow feeling would follow: gaining the knowledge while it leaves us unaffected.

Original post →

More from Fun

Fun channel →