Re:P might be NP: A Polynomial Time Algorithm for the Hamilt...
by philix001 on Wednesday May 29, 2013 @01:39PM
(#5787765)
For a sufficiently big input (N) polynomial will be faster without any doubt.
[ Parent
| on HN ]
There are no comments on this comment yet.