3 ms·
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 solvin
by skissane 11mo 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