You are currently offline. Some features of the site may not work correctly.

# Schwartz–Zippel lemma

Known as: Schwartz–Zippel lemma and testing polynomial identities, Schwartz-Zippel lemma, Schwartz-Zippel Lemma and Testing Polynomial Identities
In mathematics, the Schwartz–Zippel lemma (also called the DeMillo-Lipton-Schwartz–Zippel lemma) is a tool commonly used in probabilistic polynomial… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
• ArXiv
• 2019
• Corpus ID: 203626974
We show that, except for a special family of polynomials -that we call $\lambda$-reducible-, a natural multivariate… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
• JACM
• 2009
• Corpus ID: 14287817
We define Recursive Markov Chains (RMCs), a class of finitely presented denumerable Markov chains, and we study algorithms for… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We give a randomized algorithm that determines if a given graph has a simple path of length at least k in O(2^[email protected… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
• Karen D. Devinea, Erik G. Bomana, +5 authors Luis G. Gervasioc
• 2004
• Corpus ID: 3091404
Data partitioning and load balancing are important components of parallel computations. Many different partitioning strategies… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper sets a foundation for the study of linear codes over finite rings. The finite Frobenius rings are singled out as the… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
• 1997
• Corpus ID: 766034
A celebrated theorem of L. Schwartz asserts that a function f on R is ‘rapidly decreasing’ (or in the ‘Schwartz class’) iff its… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
• R. Zippel
• J. Symb. Comput.
• 1990
• Corpus ID: 18309914
A fundamental technique used by many algorithms in computer algebrais interpolating polynomials from their values. This paper… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
"Arithmetic reasoning" can range in complexity from simple integer arithmetic to powerful symbolic algebraic reasoning of the… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
• Pattern Recognit.
• 1985
• Corpus ID: 33810420
Abstract In pattern recognition one often wants to measure the perimeters of regions in images. This is straightforward if the… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Low-energy weak interactions are phenomenologically described in terms of an intrinsic part possessing a global SU(2) symmetry… Expand
Is this relevant?