NP Complete Humor
Ahh, jokes about non-deterministic polynomial time complexity problems. Doesn’t get much better than that!
Thank you xkcd: a webcomic of romance, sarcasm, math, and language.
(If you don’t Get It, you’re not a computer scientist.)
If you want to know more: np-complete, knapsack problem, traveling salesman, xkcd.
Why don’t I find this funny? I find the topic interesting of course but…
Comment by Corey | July 9, 2007