A proof that P = NP does not mean that all problems in NP suddenly become tractable.
What if an algorithm is found solving 3SAT with worst-case complexity O(n^g), where g is Graham's number?
A proof that P = NP does not mean that all problems in NP suddenly become tractable.
What if an algorithm is found solving 3SAT with worst-case complexity O(n^g), where g is Graham's number?
Last edited by Sang-drax; 04-10-2010 at 06:10 AM.
