To: Author
Article Fingerprint
ReserarchID
470M3
In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.
Craig Alan Feinstein. 1970. \u201cThe Computational Complexity of the Traveling Salesman Problem\u201d. Unknown Journal GJCST Volume 11 (GJCST Volume 11 Issue 23).
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: 131
Country: United States
Subject: Uncategorized
Authors: Craig Alan Feinstein (PhD/Dr. count: 0)
View Count (all-time): 145
Total Views (Real + Logic): 20856
Total Downloads (simulated): 10853
Publish Date: 1970 01, Thu
Monthly Totals (Real + Logic):
This study aims to comprehensively analyse the complex interplay between
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.