Some natural problems seem not to be complete for any of the complexity classes we have seen so far. For example, consider the problem of taking as input a graph G and a number k, and deciding whether k is exactly the length of the shortest traveling salesperson’s tour. This is clearly related to the TSP problem discussed in Chapter 28, Section 3, but in… (More)