Andere Kunden interessierten sich auch für
![Schwartz Bruhat Function]( "Schwartz Bruhat Function")
Schwartz Bruhat Function25,99 €![Schwartz Kernel Theorem]( "Schwartz Kernel Theorem")
Schwartz Kernel Theorem25,99 €![Schwartz Spaces, Nuclear Spaces and Tensor Products]( "Schwartz Spaces, Nuclear Spaces and Tensor Products")
Schwartz Spaces, Nuclear Spaces and Tensor Products42,99 €![Tucker's Lemma]( "Tucker's Lemma")
Tucker's Lemma22,99 €![Varadhan's Lemma]( "Varadhan's Lemma")
Varadhan's Lemma19,99 €![Zorn's Lemma]( "Zorn's Lemma")
Zorn's Lemma19,99 €![Van der Corput Lemma (Harmonic Analysis)]( "Van der Corput Lemma (Harmonic Analysis)")
Van der Corput Lemma (Harmonic Analysis)22,99 €
High Quality Content by WIKIPEDIA articles! The Schwartz Zippel lemma is a tool commonly used in probabilistic polynomial identity testing, i.e. in the problem of determining whether a given multivariate polynomial is the 0-polynomial or identically equal to 0. The input to the problem is an n-variable polynomial over a field F. It can occur in the following forms: Algebraic form for example, is (x_1 + 3x_2 - x_3)(3x_1 + x_4 - 1) cdots (x_7 - x_2) equiv 0. To solve this, we can multiply it out and check that all the coefficients are 0. However, this takes exponential time. In general, a polynomial can be algebraically represented by an arithmetic formula or circuit. Currently, there is no known sub-exponential time algorithm that can solve this problem deterministically. However, there are randomized polynomial algorithms for testing polynomial identities. The first of these algorithms was discovered independently by Jack Schwartz and Richard Zippel.