P versus NP
Can every problem whose answer is quick to check also be solved quickly?
Summary
Asks whether every problem whose solution a computer can verify in polynomial time can also be solved in polynomial time.
Source
Open, as listed by Clay Mathematics Institute · Millennium Prize Problems. Checked 29 Sep 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Prize
Clay Mathematics Institute · $1,000,000
Records on this problem
No public record addresses this problem yet.
