… the problem of interpolation for … time interpolation algorithm working over GF[q] to determine
all coefficients off in GF[q]. We say that the black box interpolation problem (over a finite field …

… of a straight-line program as a sparse polynomial f over an arbitrary finite field of size q. We
… is a hybrid of the diversified and recursive interpolation algorithms, the two previous fastest …

… algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with
a … Or and Tiwari from 1988 for interpolating polynomials over rings with characteristic zero to …

… for sparse polynomial interpolation when the ground field GF(… for sparse polynomial
interpolation over the finite field GF(p")… points of evaluation is sufficient for interpolating an …

… problem of interpolating and zero testing sparse multivariate polynomials over finite fields
from … Further, we present for arbitrary finite fields a new interpolation algorithm that uses only …

… In our paper we consider these problems for k-sparse multivariate polynomials over finite
fields with essentially no restriction on the degree of the polynomials. Sections 2 and 3 are …

… Venkatesan, namely the sparse polynomial noisy interpolation problem of recovering … fields.
Theor. Comp. … Non-approximability of the permanent of structured matrices over finite fields. …

… bit complexity of sparse interpolation over finite fields K=𝔽q. Sparse interpolation over the
… We analyze the complexities of specializations of existing algorithms to the finite field case …

… of sparse interpolation over finite fields \(K ={\mathbb {F}}_q\). Sparse interpolation over the
… We analyze the complexities of specializations of existing algorithms to the finite field case …

… Namely we consider the sparse polynomial approximation problem of recovering an unknown
… , On zero testing and interpolation of k-sparse multivariate polynomials over finite field, …