∞ Open Problems
Complexity TheoryNeeds more backgroundMillennium Prize: $1,000,000Open since 1971
P versus NP
If a solution to a problem can be checked quickly, can a solution also be found quickly? Here "quickly" means the time needed grows at most like a polynomial in the size of the input.
Sign in to submit your work on this problem.
0 Submissions
No submissions yet. Be the first.