The P vs. NP Problem

The following paper is a nice summary of opinions about this classical
computer science problem:
http://www.cs.umd.edu/~gasarch/papers/poll.pdf

And as I was reading it, it occurred to me that it is not obvious for me
how to check a solution to the Travelling Salesman Problem.

Suppose you compute the shortest path for a travelling salesman.
How do you actually check this result?

                                        --- Omer


-- 
MS-Windows is the Pal-Kal of the PC world.
My own blog is at http://www.zak.co.il/tddpirate/

My opinions, as expressed in this E-mail message, are mine alone.
They do not represent the official policy of any organization with which
I may be affiliated in any way.
WARNING TO SPAMMERS:  at http://www.zak.co.il/spamwarning.html