Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author A. Shankar:

TR21-163 | 19th November 2021
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, A. Shankar

Algorithmizing the Multiplicity Schwartz-Zippel Lemma

The multiplicity Schwartz-Zippel lemma asserts that over a field, a low-degree polynomial cannot vanish with high multiplicity very often on a sufficiently large product set. Since its discovery in a work of Dvir, Kopparty, Saraf and Sudan [DKSS13], the lemma has found nu- merous applications in both math and computer ... more >>>

ISSN 1433-8092 | Imprint