Construct · 1 fields · 1 citations

Schwartz-Zippel lemma: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
Schwartz-Zippellemma1 CONSTRUCTSchwartz-Zippel lemmaSCHWARTZ · 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 bound that a nonzero polynomial of degree d vanishes at a random point from a set S with probability at most d over the size of S.

In computational complexity, Schwartz-Zippel lemma refers to the bound that a nonzero polynomial of degree d vanishes at a random point from a set S with probability at most d over the size of S. This meaning comes from Schwartz (1980) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

Next

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

See how Schwartz-Zippel 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

complexity4 fields · 7 citationsjingle · one word, four constructsdegree1 fields · 1 citationsanchor · a standalone constructlemma1 fields · 3 citationsanchor · a standalone construct

References

  1. Schwartz, J. T. (1980). Fast Probabilistic Algorithms for Verification of Polynomial Identities. Journal of the ACM, 27(4), 701-717. https://doi.org/10.1145/322217.322225

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