Construct · 1 fields · 1 citations

switching lemma: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
switchinglemma1 CONSTRUCTSwitching lemmaHASTAD · COMPUTATIONAL

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 a random restriction turns a small-width DNF into a small-width CNF with high probability, the main tool for constant-depth circuit lower bounds.

In computational complexity, switching lemma refers to the result that a random restriction turns a small-width DNF into a small-width CNF with high probability, the main tool for constant-depth circuit lower bounds. This meaning comes from Hastad (1986) in Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86.[1]

Unit
Recovery means
Measured by

Next

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

See how switching lemma sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

circuit1 fields · 1 citationsanchor · a standalone constructcomplexity4 fields · 7 citationsjingle · one word, four constructslemma1 fields · 3 citationsanchor · a standalone construct

References

  1. Hastad, J. (1986). Almost optimal lower bounds for small depth circuits. Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86. https://doi.org/10.1145/12130.12132

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