Abstract

In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.

How to Cite
ALAN FEINSTEIN, Craig. The Computational Complexity of the Traveling Salesman Problem. Global Journal of Computer Science and Technology, [S.l.], feb. 2012. ISSN 0975-4172. Available at: <https://computerresearch.org/index.php/computer/article/view/413>. Date accessed: 25 jan. 2021.