Is there a lower bound for the computational complexity of the traveling salesman problem? – mathoverflow.net

Is there a lower bound for the computational complexity of the traveling salesman problem? – mathoverflow.net

11:52 No Comments
A (non-mathematician) acquaintance of mine recently proposed to me a polynomial-time algorithm for solving the traveling salesman problem. While I was able to point out a flaw in his approach, it did ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

Artikel Terkait

0 Comment to "Is there a lower bound for the computational complexity of the traveling salesman problem? – mathoverflow.net"

Post a Comment

Subscribe to: Post Comments (Atom)