The Computational Complexity of the Traveling Salesman Problem

Craig Alan Feinstein

Craig Alan Feinstein

Abstract

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

PDF

Published 2012-02-10

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.

Issue

Global Journal of Computer Science and Technology

Section

Articles

Collaborations & Partnerships

Global Journals works in collaboration with many universities and other research institutions from all around the globe knowledge-sharing purposes. Our dedicated progressive platforms that keep on innovating every day help researchers to work toghether by sharing scientific knowledge.

Organize Conference

We organize seminars /symposium /conferences/workshop/webinar worldwide on innovative topics and fields of Computer Science and research. We also collaborate, partner or sponsor with a view to provide our professional guidance and expertise to conduct in standard way.

We also publish proceedings of already conducted seminars and co-ordinate different organizers across world for same.

Research Membership

Global Journals Inc., as described in our Corporate Statement, is an educational, research, research publishing, and professional membership organization. Elevation to the ranks of Fellow of the Association of the Research Society in Computer and Member of the Association of the Research Society in Computer is open.

Abstract

##plugins.themes.bootstrap3.article.sidebar##

Collaborations & Partnerships

Organize Conference

Research Membership