Post
Alexandre Oliva Envious Condor 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?
maybe go back to your reference book and see how the traveling salesman problem that is NP-complete is defined. while at that, look at the definition of NP-complete: problems that (apparently) cannot be solved in polynomial time, but whose solutions can be verified in polynomial time CC: Sore Cod