@lxo @home no, not all NP-complete problems are like that.
You give me a map, and tell me to solve the traveling salesman problem, and I give you a result. How do you verify the result I give you _really is_ the shortest possible path, and not a lie?