4 ms·
TSP is NP-hard for optimisation version and NP-complete for decision version. Consider how you would test that a minimal solution is minimal vs testing whether
by sometimesijust 8y ago
TSP is NP-hard for optimisation version and NP-complete for decision version. Consider how you would test that a minimal solution is minimal vs testing whether a given solution has less than a given cost. PPAD is less complete than these two classes.
The decision problem for Nash Equilibria might be, does a second equilibrium exist?
- mygo 8y agoAah gotcha. So you’re saying it’s easier to verify the solution to a Nash equilibrium problem than it is to verify the solution to the TSP optimization problem?