pdfformat: 

@InProceedings{harsha_et_al:LIPIcs:2016:6852, author = {Prahladh Harsha and Srikanth Srinivasan}, title = {{Robust MultiplicationBased Tests for ReedMuller Codes}}, booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)}, pages = {17:117:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770279}, ISSN = {18688969}, year = {2016}, volume = {65}, editor = {Akash Lal and S. Akshay and Saket Saurabh and Sandeep Sen}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6852}, URN = {urn:nbn:de:0030drops68524}, doi = {10.4230/LIPIcs.FSTTCS.2016.17}, annote = {Keywords: Polynomials over finite fields, SchwartzZippel lemma, Low degree testing, Low degree long code} }
Keywords:  Polynomials over finite fields, SchwartzZippel lemma, Low degree testing, Low degree long code  
Seminar:  36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)  
Issue date:  2016  
Date of publication:  10.12.2016 