Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Ladner's theorem
|
| gptkbp:implies |
Existence of NP-intermediate problems if P ≠ NP
|
| gptkbp:namedAfter |
gptkb:Richard_E._Ladner
|
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:NP-completeness
gptkb:P_versus_NP_problem |
| gptkbp:state |
If P ≠ NP, then there exist problems in NP that are neither in P nor NP-complete.
|
| gptkbp:yearProposed |
1975
|
| gptkbp:bfsParent |
gptkb:Richard_Ladner
gptkb:Richard_E._Ladner |
| gptkbp:bfsLayer |
6
|