|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:award
|
1 million USD
|
|
gptkbp:awardedBy
|
gptkb:Clay_Mathematics_Institute
|
|
gptkbp:category
|
gptkb:Millennium_Prize_Problems
open problems in mathematics
|
|
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
gptkb:Leonid_Levin
|
|
gptkbp:formulatedYear
|
1971
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
P versus NP Problem
|
|
gptkbp:implies
|
If P≠NP, some problems can be verified quickly but not solved quickly
If P=NP, many currently intractable problems would become efficiently solvable
|
|
gptkbp:importantFor
|
one of the most important open problems in computer science
|
|
gptkbp:millenniumPrizeProblem
|
true
|
|
gptkbp:notableAttempt
|
gptkb:Deolalikar's_2010_claim_(not_accepted)
|
|
gptkbp:relatedConcept
|
gptkb:NP_(complexity_class)
gptkb:P_(complexity_class)
NP-complete
|
|
gptkbp:relatedTo
|
gptkb:artificial_intelligence
cryptography
algorithm design
|
|
gptkbp:status
|
unsolved
|
|
gptkbp:bfsParent
|
gptkb:Clay_Mathematics_Institute_Millennium_Prize_Problems
|
|
gptkbp:bfsLayer
|
7
|