The Computational Complexity of the Traveling Salesman Problem
<|reference_start|>The Computational Complexity of the Traveling Salesman Problem: In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.<|reference_end|>
@article{feinstein2006the,
    title={The Computational Complexity of the Traveling Salesman Problem},
    author={Craig Alan Feinstein},
    journal={Global Journal of Computer Science and Technology, Volume 11 Issue
  23, December 2011, pp 1-2},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0611082},
    primaryClass={cs.CC}
}