The Computational Complexity of the Traveling Salesman Problem
arXiv:cs/0611082
Abstract
In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.
1 page, made a minor correction
arXiv:cs/0611082
In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.
1 page, made a minor correction