|
|
|
|
|
|
by twic
4784 days ago
|
|
|
Ken Regan, who is some kind of computerologist, has a really interesting post pointing out that TSP is actually one of the easier NP-complete problems, and even an O(n) solution only reduces the interesting NP-complete problems to really hard polynomial-time problems. http://rjlipton.wordpress.com/2012/04/22/the-travelling-sale... |
|
|