Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:citation |
gptkb:Karp,_R._M.,_&_Lipton,_R._J._(1980)._Some_connections_between_nonuniform_and_uniform_complexity_classes._JCSS,_21(3),_302-318.
|
| gptkbp:field |
gptkb:theoretical_computer_science
|
| gptkbp:impact |
major result in structural complexity theory
|
| gptkbp:namedAfter |
gptkb:Richard_Karp
gptkb:Richard_Lipton |
| gptkbp:publishedIn |
gptkb:Journal_of_Computer_and_System_Sciences
|
| gptkbp:relatedTo |
gptkb:P/poly
NP polynomial hierarchy |
| gptkbp:sentence |
If NP is contained in P/poly, then the polynomial hierarchy collapses to its second level (Σ2P = PH).
|
| gptkbp:yearProposed |
1980
|
| gptkbp:bfsParent |
gptkb:EXP/poly
|
| gptkbp:bfsLayer |
6
|
| http://www.w3.org/2000/01/rdf-schema#label |
Karp and Lipton
|