|
gptkbp:instanceOf
|
gptkb:computational_complexity_problem
|
|
gptkbp:abbreviation
|
gptkb:P_vs_NP
|
|
gptkbp:asksWhether
|
P equals NP
|
|
gptkbp:award
|
1 million USD
|
|
gptkbp:centralTo
|
gptkb:theoretical_computer_science
|
|
gptkbp:describes
|
relationship between P and NP complexity classes
|
|
gptkbp:field
|
gptkb:theoretical_computer_science
gptkb:mathematics
|
|
gptkbp:formedBy
|
gptkb:Stephen_Cook
gptkb:Leonid_Levin
1971
|
|
gptkbp:hasNoKnownSolution
|
true
|
|
gptkbp:hasOpenQuestion
|
P = NP?
|
|
gptkbp:implies
|
gptkb:artificial_intelligence
cryptography
optimization
algorithm design
|
|
gptkbp:importantFor
|
fundamental question in computer science
|
|
gptkbp:includedIn
|
gptkb:Clay_Mathematics_Institute_Millennium_Prize_Problems
|
|
gptkbp:isMillenniumPrizeProblem
|
true
|
|
gptkbp:relatedTo
|
NP class
NP-complete
P class
|
|
gptkbp:status
|
unsolved
|
|
gptkbp:type
|
Is every problem whose solution can be quickly verified by a computer also quickly solvable by a computer?
|
|
gptkbp:bfsParent
|
gptkb:Mathematische_Probleme
|
|
gptkbp:bfsLayer
|
5
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
P-NP-Problem
|