The Traveling Salesman Problem Is Not NP-Complete

Thanks for posting this! Distinctions like NP-complete versus NP-hard are worth maintaining, especially because they're so often confused.