@InProceedings{harsha_et_al:LIPIcs.FSTTCS.2016.17,
author = {Harsha, Prahladh and Srinivasan, Srikanth},
title = {{Robust Multiplication-Based Tests for Reed-Muller Codes}},
booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-027-9},
ISSN = {1868-8969},
year = {2016},
volume = {65},
editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.17},
URN = {urn:nbn:de:0030-drops-68524},
doi = {10.4230/LIPIcs.FSTTCS.2016.17},
annote = {Keywords: Polynomials over finite fields, Schwartz-Zippel lemma, Low degree testing, Low degree long code}
}