The Computational Complexity of the Traveling Salesman Problem

Details The Computational Complexity of the Traveling Salesman Problem The Computational Complexity of the Traveling Salesman Problem

2006-11-17

arxiv.org/abs/cs/0611082v6

Global Journal of Computer Science and Technology, Volume 11 Issue 23, December 2011, pp 1-2

Computer Science

Computational Complexity

1 page, made a minor correction

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

The Computational Complexity of the Traveling Salesman Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Computational Complexity of the Traveling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Computational Complexity of the Traveling Salesman Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-338016