3 ms·The Traveling Salesman Problem Is Not NP-Complete2 points by eklitzke 9y agosevensor 9y agoThanks for posting this! Distinctions like NP-complete versus NP-hard are worth maintaining, especially because they're so often confused.