3 ms·
I don't think proving N = NP would necessarily give us an easy way to transform any NP problem into a P one. It could be a nonconstructive proof. You would know
by ramchip 17y ago
I don't think proving N = NP would necessarily give us an easy way to transform any NP problem into a P one. It could be a nonconstructive proof. You would know that a given encryption could possibly be cracked, but not how.
- g__ 17y agoUnder assumption P=NP, a polynomial algorithm is already known (!): http://en.wikipedia.org/wiki/P_%3D_NP_problem#Polynomial-time_algorithms http://en.wikipedia.org/wiki/P_%3D_NP_problem#Polynomial-tim... The problem is: will humanity find a feasible algorithm?