Computational complexity
Millennium Prize Problem
Status: Open
Status last verified
P versus NP
If a proposed answer can be checked quickly, can it also be found quickly? Formally: is every problem in NP also in P?
Reviewers check that a contribution is clear, honest about its evidence and useful to other researchers. An accepted proof draft is not a verified proof, and acceptance never changes the problem's status.
Accepted contributions
None yet. Yours could be the first.
Sign in to write and submit your own contributions.
Sign in with Zerethon