Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #1 to TR10-096 | 8th July 2010 21:04

An Alternative Proof of The Schwartz-Zippel Lemma

RSS-Feed




Revision #1
Authors: Dana Moshkovitz
Accepted on: 8th July 2010 21:04
Downloads: 9087
Keywords: 


Abstract:

We show an alternative proof of the Schwartz-Zippel lemma. The lemma bounds the number of zeros of a multivariate low degree polynomial over a finite field.


Paper:

TR10-096 | 16th June 2010 01:18

An Alternative Proof of The Schwartz-Zippel Lemma





TR10-096
Authors: Dana Moshkovitz
Publication: 16th June 2010 02:20
Downloads: 5378
Keywords: 


Abstract:

We show a non-inductive proof of the Schwartz-Zippel lemma. The lemma bounds the number of zeros of a multivariate low degree polynomial over a finite field.



ISSN 1433-8092 | Imprint