|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:award
|
1 million USD
|
|
gptkbp:describes
|
Asks whether every problem whose solution can be quickly verified can also be quickly solved.
|
|
gptkbp:field
|
theoretical computer science
|
|
gptkbp:formedBy
|
gptkb:Stephen_Cook
1971
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
P vs NP problem
|
|
gptkbp:implies
|
gptkb:artificial_intelligence
gptkb:complexity_theory
gptkb:logic
gptkb:mathematics
cryptography
operations research
algorithm design
|
|
gptkbp:importantFor
|
one of the most important open problems in computer science
|
|
gptkbp:millenniumPrizeProblem
|
true
|
|
gptkbp:notableAttempt
|
gptkb:Deolalikar's_2010_claim_(not_accepted)
gptkb:Vinay_Deolalikar
Sergei Cook's 1971 paper
|
|
gptkbp:offeredBy
|
gptkb:Clay_Mathematics_Institute
|
|
gptkbp:relatedTo
|
gptkb:NP_(complexity_class)
gptkb:P_(complexity_class)
NP-complete
|
|
gptkbp:seeAlso
|
gptkb:Cook–Levin_theorem
gptkb:Karp's_21_NP-complete_problems
gptkb:Millennium_Prize_Problems
gptkb:NP-hard
gptkb:SAT_problem
Turing Award
NP-complete
|
|
gptkbp:status
|
unsolved
|
|
gptkbp:bfsParent
|
gptkb:complexity_theory
gptkb:Algorithms_and_Complexity
|
|
gptkbp:bfsLayer
|
4
|