|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:award
|
gptkb:Clay_Millennium_Prize_Problem
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
gptkb:Leonid_Levin
|
|
gptkbp:formulatedYear
|
1971
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
P versus NP problem
|
|
gptkbp:impact
|
Has implications for algorithm design
Has implications for artificial intelligence
Has implications for cryptography
|
|
gptkbp:importantFor
|
one of the most important open problems in computer science
|
|
gptkbp:notableAttempt
|
Vinay Deolalikar (2010)
|
|
gptkbp:notableAttemptStatus
|
not accepted
|
|
gptkbp:organizationOfferingPrize
|
gptkb:Clay_Mathematics_Institute
|
|
gptkbp:publicationYear
|
1971
|
|
gptkbp:publishedIn
|
gptkb:The_Complexity_of_Theorem-Proving_Procedures
|
|
gptkbp:relatedTo
|
NP class
NP-complete
P class
|
|
gptkbp:status
|
unsolved
|
|
gptkbp:type
|
Is P equal to NP?
Is P not equal to NP?
|
|
gptkbp:bfsParent
|
gptkb:Stephen_Cook
|
|
gptkbp:bfsLayer
|
5
|