The Computational Complexity of the Traveling Salesman Problem
Abstract
In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.