TSP Escapes the $O(2^n n^2)$ Curse

Proof of concept for our algorithm in time $2^n n^2 / 2^{\Omega(\sqrt{\log n})}$, which improves over the standard dynamic programming solution in time $O(2^n n^2)$ designed in 1962.

Check out the blog post!