Hacker News new | ask | show | jobs
by nrhrjrjrjtntbt 188 days ago
P=NP feels like too much of a free lunch. Yeah thats unscientific but a hunch.
1 comments
skissane 187 days ago
It needn’t be a “free lunch” at all. An O(n^1000) algorithm for an NP-complete problem would constructively prove that P=NP yet be completely useless for solving any NP problems in practice
link