arXiv Open Access 2006

The Computational Complexity of the Traveling Salesman Problem

Craig Alan Feinstein

Lihat Sumber

Abstrak

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

cs.CC

Craig Alan Feinstein

APA MLA BibTeX

Feinstein, C.A. (2006). The Computational Complexity of the Traveling Salesman Problem. https://arxiv.org/abs/cs/0611082

Lihat di Sumber

Informasi Jurnal