19 search results - page 1 / 4 » Noisy interpolation of sparse polynomials in finite fields |
AAECC
2005
Springer
13 years 5 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...
CAP
2010
13 years 1 days ago
2010
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
ARITH
2009
IEEE
13 years 12 months ago
2009
IEEE
A method for polynomial multiplication over finite fields using field extensions and polynomial interpolation is introduced. The proposed method uses polynomial interpolation a...
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...
TC
2002
13 years 4 months ago
2002
We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary t points, we show ...