3 ms·
>any NP problem can be polynomially reduced to an NP-hard problem Except that there is some probability that the algorithm will be unable to solve the problem?
by jsprogrammer 11y ago
>any NP problem can be polynomially reduced to an NP-hard problem
Except that there is some probability that the algorithm will be unable to solve the problem?
- eru 11y agoSuccess/Failure would be independent between runs. Ie if you fail, you just run again.