The Computational Complexity of the Traveling Salesman Problem
Keywords:
Traveling, Problem, polynomial, classical
Abstract
In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Craig Alan Feinstein. (2011). The Computational Complexity of the Traveling Salesman Problem. Global Journal of Computer Science and Technology, 11(23), 1–1. Retrieved from https://computerresearch.org/index.php/computer/article/view/413
Published
2011-08-15
Issue
Section
Articles
License
Copyright (c) 2011 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.