Complexity TheoryResearch frontierMillennium Prize — $1,000,000Open since 1971

P versus NP

Does every problem whose solution can be quickly verified also have a solution that can be quickly found? One of the most consequential open questions in mathematics and computer science — its resolution would reshape cryptography, optimization, and artificial intelligence.

Sign in to submit your work on this problem.

0 Submissions

No submissions yet. Be the first.