News for hackers. Stuff that matters.
Re:P ≠ NP by jules on Sunday August 08, 2010 @07:38PM (#1586499)
Not true. A polynomial time algorithm for NP complete programs is known (if P=NP that is). You just need to prove P=NP to prove that it is polynomial time.

http://en.wikipedia.org/wiki/P_versus_NP_problem#Polynomial-...

There are no comments on this comment yet.