|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:award
|
gptkb:Clay_Mathematics_Institute_Millennium_Prize
1 million USD
|
|
gptkbp:field
|
gptkb:theoretical_computer_science
computer science
|
|
gptkbp:formedBy
|
gptkb:Stephen_Cook
1971
|
|
gptkbp:impact
|
gptkb:artificial_intelligence
gptkb:mathematics
cryptography
operations research
algorithm design
|
|
gptkbp:importantFor
|
gptkb:Hilbert_problem
|
|
gptkbp:notableAttempt
|
gptkb:Vinay_Deolalikar
|
|
gptkbp:notableAttemptStatus
|
not accepted
|
|
gptkbp:notableAttemptYear
|
2010
|
|
gptkbp:relatedTo
|
gptkb:NP_complexity_class
gptkb:P_complexity_class
|
|
gptkbp:seeAlso
|
gptkb:Turing_Award
gptkb:Cook–Levin_theorem
gptkb:Karp's_21_NP-complete_problems
gptkb:NP-hard
gptkb:SAT_problem
gptkb:NP-intermediate
gptkb:exponential_time_hypothesis
NP-complete
computational intractability
|
|
gptkbp:status
|
unsolved
|
|
gptkbp:type
|
Is P equal to NP?
|
|
gptkbp:bfsParent
|
gptkb:Clay_Millennium_Prize_Problem
gptkb:Clay_Millennium_Prize
gptkb:Clay_Mathematics_Institute_Millennium_Prize
|
|
gptkbp:bfsLayer
|
7
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
P vs NP Problem
|