Re:The polynomial algorithm for 3-SAT problem (or P=NP)
by amalcon on Wednesday January 19, 2011 @09:26PM
(#2122319)
The negative effects of ruining public-key cryptography completely pale in comparison to the benefits. The traveling salesman problem alone has so many practical and scientific applications that it would be worthwhile, and that's not even counting subgraph isomorphism or knapsack.
[ Parent
| on HN ]
There are no comments on this comment yet.