News for hackers. Stuff that matters.
Re:Solving dynamic programming interview problems by zodiac on Saturday May 19, 2018 @05:42AM (#17107238)
Interesting fact: the standard DP algorithm for TSP reduces the running time from O(n!) to O(n^2 2^n)

There are no comments on this comment yet.