News for hackers. Stuff that matters.
Re:P might be NP: A Polynomial Time Algorithm for the Hamilt... by marcosdumay on Wednesday May 29, 2013 @08:49AM (#5785935)
That's a good question, but always keep in mind that polynomial time doesn't imply that it'll be faster than the currently used algorithms on any real application.
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.