Re:Donald Knuth making an Earthshaking Announcement June 30 ...
by ramchip on Monday April 12, 2010 @10:02AM
(#1259119)
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.
[ Parent
| on HN ]
Re:Donald Knuth making an Earthshaking Announcement June 30 ...
by g__ on Monday April 12, 2010 @01:32PM
(#1259789)
Under assumption P=NP, a polynomial algorithm is already known (!): http://en.wikipedia.org/wiki/P_%3D_NP_problem#Polynomial-tim...
The problem is: will humanity find a feasible algorithm?