To: Author
Article Fingerprint
ReserarchID
CST470M3
Choose where you want to hide AI Takeaway. Your site-wide choice will be remembered in this browser.
In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.
Craig Alan Feinstein. 1970. "The Computational Complexity of the Traveling Salesman Problem". Global Journal of Computer Science and Technology GJCST Volume 11 (GJCST Volume 11 Issue 23).
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 171
Country: United States
Subject: Global Journal of Computer Science and Technology
Authors: Craig Alan Feinstein (PhD/Dr. count: 0)
View Count (all-time): 359
Total Views (Real + Logic): 6224
Total Downloads (simulated): 381
Publish Date: 2011 12, Sat
Monthly Totals (Real + Logic):
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.