29 search results - page 1 / 6 » Noisy Interpolating Sets for Low Degree Polynomials |
COCO
2008
Springer
13 years 6 months ago
2008
Springer
COCO
2011
Springer
12 years 4 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
AAECC
2005
Springer
13 years 4 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...