Testing Low-Degree Polynomials over Prime Fields

13 years 8 months ago

Download www.cse.buffalo.edu

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

Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra

Real-time Traffic

Algorithm Queries | Efficient Randomized Algorithm | FOCS 2004 | Low-degree Polynomial | Theoretical Computer Science |

claim paper

» Pseudorandom generators for CC0p and the Fourier spectrum of lowdegree polynomials over fi...

» An Identification Scheme Based on Sparse Polynomials

» Revisiting Gausss analogue of the prime number theorem for polynomials over a finite field

» Relatively prime polynomials and nonsingular Hankel matrices over finite fields

» On the Structure of Cubic and Quartic Polynomials

» Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields

» Construction of Secure Random Curves of Genus 2 over Prime Fields

» On the number of directions determined by a pair of functions over a prime field

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2004
Where	FOCS
Authors	Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman

Comments (0)

Sciweavers

Testing Low-Degree Polynomials over Prime Fields

Algorithm Queries | Efficient Randomized Algorithm | FOCS 2004 | Low-degree Polynomial | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers