Subtle point: we already have an algorithm that would sovle NP-complete problems in P time if P=NP; it's just that we don't have a proof that it works that way.

Subtle point: we already have an algorithm that would sovle NP-complete problems in P time if P=NP; it's just that we don't have a proof that it works that way. See for example http://en.wikipedia.org/wiki/P_%3D_NP_problem#Polynomial-time_algorithms http://en.wikipedia.org/wiki/P_%3D_NP_problem#Polynomial-tim...