Testing Low-Degree Polynomials over Prime Fields

We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed-Muller codes over prime fields. For a given integer t and a given real > 0, the algorithm queries f at 1 + t

• Type: Conference
• Year: 2004
• Where: FOCS
• Authors: Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman
• Keywords: Algorithm Queries, Efficient Randomized Algorithm, FOCS 2004, Low-degree Polynomial, Theoretical Computer Science