Statements (32)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:award |
gptkb:Clay_Mathematics_Institute_Millennium_Prize
1 million USD |
| gptkbp:field |
computer science
theoretical computer science |
| gptkbp:formedBy |
gptkb:Stephen_Cook
1971 |
| https://www.w3.org/2000/01/rdf-schema#label |
P vs NP Problem
|
| gptkbp:impact |
gptkb:artificial_intelligence
gptkb:mathematics cryptography operations research algorithm design |
| gptkbp:importantFor |
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:Cook–Levin_theorem
gptkb:Karp's_21_NP-complete_problems gptkb:NP-hard gptkb:SAT_problem gptkb:NP-intermediate gptkb:exponential_time_hypothesis Turing Award NP-complete computational intractability |
| gptkbp:status |
unsolved
|
| gptkbp:type |
Is P equal to NP?
|
| gptkbp:bfsParent |
gptkb:Clay_Millennium_Prize
|
| gptkbp:bfsLayer |
5
|