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?
Sign in to keep private research notes for this problem.
Sign in with Zerethon