Hacker News
- xkcd: What's the complexity class of the best linear programming cutting-plane techniques? I couldn't find it anywhere. Man, the Garfield guy doesn't have these problems http://www.xkcd.com/399/ 69 comments programming
- xkcd: Travelling Salesman Problem http://www.xkcd.com/399/ 5 comments reddit.com
Linking pages
- How elliptic curve cryptography works in TLS 1.3 / Habr https://habr.com/en/company/qrator/blog/474810/ 21 comments
- Your Favorite NP-Complete Cheat http://www.codinghorror.com/blog/archives/001187.html 16 comments
- Recent Advances in Deep Learning for Routing Problems | Chaitanya K. Joshi https://www.chaitjo.com/post/deep-learning-for-routing-problems/ 3 comments
Related searches:
Search whole site: site:xkcd.com
Search title: xkcd: Travelling Salesman Problem
See how to search.