All Questions
1 question
3
votes
2
answers
1k
views
Is there a lower bound for the computational complexity of the traveling salesman problem?
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 ...
- 82.7k