Is P equivalent to NP?
The P versus NP problem is a major unsolved problem in computer science. Informally, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. For a correct solution of the “P versus NP” question, the Clay Mathematics Institute (CMI) will award a prize of $1.000.000.