Filed Under (Geek) by Pierre-Selim on 21-03-2008
Pourquoi n’y avait je pas pensé avant:

[1] Randall Munroe, 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 …
, XKCD: A Webcomic of Romance, Sarcasm, Math and Language, issue 399