Re:'Breakthrough' algorithm exponentially faster than any pr...
by Hnrobert42 on Tuesday July 03, 2018 @10:09PM
(#17454871)
I think the point is that they are willing to accept the risk of not choosing the truly best available solution in return for speed. Most practical solutions for these NP problems make the same sacrifice. The authors are just claiminng to be more effecient in deriving an approximate solution.
[ Parent
| on HN ]
There are no comments on this comment yet.