Construct · 1 fields · 1 citations

Razborov-Smolensky method: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
Razborov-Smolenskymethod1 CONSTRUCTRazborov-SmolenskySMOLENSKY · 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

proving circuit lower bounds by approximating constant-depth circuits with modular gates by low-degree polynomials over a finite field.

In computational complexity, Razborov-Smolensky method refers to proving circuit lower bounds by approximating constant-depth circuits with modular gates by low-degree polynomials over a finite field. This meaning comes from Smolensky (1987) in Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87.[1]

Unit
Recovery means
Measured by

Next

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

See how Razborov-Smolensky method 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 constructsfield3 fields · 5 citationsjingle · one word, three constructs

References

  1. Smolensky, R. (1987). Algebraic methods in the theory of lower bounds for Boolean circuit complexity. Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87. https://doi.org/10.1145/28395.28404

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