The Computational Complexity of the Traveling Salesman Problem
  In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer. 
Craig Alan Feinstein