Re:P versus NP Explained
by random_coder on Monday February 03, 2014 @02:45PM
(#7172959)
It's not true. If a poly-time solution is found for NP-hard problem, then it's not necessarily true that other NP-hard problems can be solved in polynomial time. However, if poly-time solution for an NP-hard implies every NP-complete (and thus every problem in NP) has a polynomial time solution.
[ Parent
| on HN ]
There are no comments on this comment yet.