Hacker News new | ask | show | jobs
by zodiac 2958 days ago
Interesting fact: the standard DP algorithm for TSP reduces the running time from O(n!) to O(n^2 2^n)