I was looking through today and ran into this beauty:

It's funny to me 'cause was one of subjects that I most enjoyed out of my Theory of Computation class at ...and the Knapsack problem kicked my ass trying to understand it.  Yes, I'm both sick and sad at the same time... ;-)

For those of you (math/cs) geeks out there, check out these other famous NP-Complete problems: