Revision as of 18:25, 29 January 2009 by Amcphers (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


This P = NP problem is pretty interesting to me, as well. We learned about it a little last year in Discrete, but I still don't really understand it. It seems to be so ambiguous. Who decides how quick 'quick' is in the definition? I guess that's why the Clay Mathematics Institute is offering $1 million for a correct proof of the problem.

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood