Skip to content

Comment on Travelling Salesman – Official Movie Siteparent

Comments

Sufficient for any practical use is not "solved" in the mathematical sense.

Also, AFAIK, a general solution to P=NP could still be very time consuming to calculate (even if you prove polynomial time solutions, that could still be a very high order polynomial). That is, your general solution to the problem could be only slightly better than O(n!) and satisfy.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.