P versus NP problem
E131016
UNEXPLORED
The P versus NP problem is a central unsolved question in theoretical computer science that asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.
Referenced by (3)
| Subject (surface form when different) | Predicate |
|---|---|
|
Millennium Prize Problem
→
|
hasProblem |
|
Avi Wigderson
→
|
hasResearchInterest |
|
Stephen Cook
→
|
knownFor |