Re:Genetic Algorithm for Knapsack Problem
by a-nikolaev on Wednesday June 19, 2013 @11:19AM
(#5906020)
Nitpicking: In general, an NP problem can be reduced to an NP-hard problem (in poly-time).
[ Parent
| on HN ]
There are no comments on this comment yet.