Construct · 1 fields · 1 citations

Karp-Lipton theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the result that if NP has polynomial-size circuits then the polynomial hierarchy collapses to its second level.

In computational complexity, Karp-Lipton theorem refers to the result that if NP has polynomial-size circuits then the polynomial hierarchy collapses to its second level. This meaning comes from Karp (1980) in Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Karp-Lipton theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructs hierarchy4 fields · 4 citationsjingle · one word, four constructs level1 fields · 1 citationsanchor · a standalone construct

References

Karp, R. M., & Lipton, R. J. (1980). Some connections between nonuniform and uniform complexity classes. Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80. https://doi.org/10.1145/800141.804678

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct