Recomm. for undergrads: no
Prize: $1,000,000 (Clay Math. I.)
Posted by: zitterbewegung
on: October 18th, 2007
Problem   Is P = NP?

This problem is the central open problem in Theoretical Computer Science and is regarded as one of the most outstanding unsolved problems in mathematics. See Wikipedia's P versus NP problem and The Clay Mathematical Institute's P vs. NP problem for more.


Comments are limited to a maximum of 1000 characters.
More information about formatting options