Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Karp-Lipton theorem
|
| gptkbp:implies |
If NP ⊆ P/poly, then PH = Σ2^P
|
| gptkbp:namedAfter |
gptkb:Richard_Karp
gptkb:Richard_Lipton |
| gptkbp:publishedIn |
gptkb:Journal_of_Computer_and_System_Sciences
|
| gptkbp:relatedTo |
gptkb:P/poly
NP non-uniform complexity polynomial hierarchy |
| gptkbp:state |
If NP is contained in P/poly, then the polynomial hierarchy collapses to its second level (Σ2^P = PH).
|
| gptkbp:yearProposed |
1980
|
| gptkbp:bfsParent |
gptkb:P/poly_complexity_class
|
| gptkbp:bfsLayer |
5
|