Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic_journal
|
| gptkbp:author |
gptkb:Richard_M._Karp
gptkb:Richard_J._Lipton |
| gptkbp:citation |
many subsequent works in theoretical computer science
|
| gptkbp:contribution |
Studied the relationship between nonuniform and uniform complexity classes
Introduced the Karp-Lipton theorem |
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Karp and Lipton, 1980
|
| gptkbp:publishedIn |
Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC 1980)
|
| gptkbp:result |
If NP is contained in P/poly, then the polynomial hierarchy collapses to its second level
|
| gptkbp:title |
Some Connections Between Nonuniform and Uniform Complexity Classes
|
| gptkbp:year |
1980
|
| gptkbp:bfsParent |
gptkb:PPoly
|
| gptkbp:bfsLayer |
8
|