News for hackers. Stuff that matters.
Re:P≠NP proof update by nandemo on Monday August 16, 2010 @12:38AM (#1606852)
You could still have used big O notation:

"what if some NP-hard problems could be solved in O(n^(1000^1000))?"

That is polynomial time so those problems would be in P, but in practice they would be intractable.

There are no comments on this comment yet.