Re:P might be NP: A Polynomial Time Algorithm for the Hamilt...
by im3w1l on Wednesday May 29, 2013 @07:19PM
(#5789898)
The problem is that, even though it is faster it isn't fast enough. You can't solve any real world large problems with a n^100 algo, even though it is faster in theory.
[ Parent
| on HN ]
There are no comments on this comment yet.