3 ms·
Indeed. Also note that if someone found a polytime algorithm for TSP, that would imply P = NP and that would be quite a discovery.
by Kenji 12y ago
Indeed. Also note that if someone found a polytime algorithm for TSP, that would imply P = NP and that would be quite a discovery.