The Schwartz-Zippel lemma is a tool used in probabilistic polynomial identity testing, the problem of deciding whether a multivariate polynomial is identically zero. It states that evaluating a nonzero polynomial at a point chosen at random from a sufficiently large set is very likely to produce a nonzero result, so instead of expanding a polynomial symbolically, which can take exponential time, an algorithm can test it by evaluating it at a few random points. The result was found independently by several people: Jack Schwartz and Richard Zippel published versions of it around 1979 and 1980, Richard DeMillo and Richard Lipton had published an equivalent result in 1978, and Oystein Ore had already proved the finite-field case in 1922. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Connections
Credited To
Source Wikipedia: Schwartz-Zippel lemma
Invented By
Source Wikipedia: Schwartz-Zippel lemma
Uses Design Technique
Source Wikipedia: Schwartz-Zippel lemma
Sources
Wikipedia: Schwartz-Zippel lemma
Lead section
In mathematics, the Schwartz-Zippel lemma (also called the DeMillo-Lipton-Schwartz-Zippel lemma) is a tool commonly used in probabilistic polynomial identity testing.
Uses Design Technique: Randomized Algorithms, Lead
The lemma states that evaluating a nonzero polynomial on inputs chosen randomly from a large-enough set is likely to find an input that produces a nonzero output. it was discovered independently by Jack Schwartz, Richard Zippel, and Richard DeMillo and Richard J.
Credited To: Richard DeMillo, Lead paragraph
it was discovered independently by Jack Schwartz, Richard Zippel, and Richard DeMillo
Invented By: Richard DeMillo, Lead paragraph
it was discovered independently by Jack Schwartz, Richard Zippel, and Richard DeMillo
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.