| | |
Summary: -discrepancy sets and their applications for interpolation
of sparse polynomials
Noga Alon
Yishay Mansour
February 22, 2002
Abstract
We present a simple explicit construction of a probability distribution supported on (p - 1)2
vectors in Zn
p , where p n/ is a prime, for which the absolute value of each nontrivial Fourier
coefficients is bounded by . This construction is used to derandomize the algorithm of [Man92]
that interpolates a sparse polynomial in polynomial time in the bit complexity model.
1 Introduction
Given a set A Zn
p , for each Zn
p define
DISCA() =
1
|A| zA
<,z>
,
|
