A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Sparse Polynomial Interpolation Based on Diversification
[article]
2020
arXiv
pre-print
We consider the problem of interpolating a sparse multivariate polynomial over a finite field, represented with a black box. Building on the algorithm of Ben-Or and Tiwari for interpolating polynomials over rings with characteristic zero, we develop a new Monte Carlo algorithm over the finite field by doing additional probes. To interpolate a polynomial f∈ F_q[x_1,...,x_n] with a partial degree bound D and a term bound T, our new algorithm costs O^(nTlog ^2q+nT√(D)log q) bit operations and uses
arXiv:2002.03706v1
fatcat:2dngbk4z3bdktihacrjma3tm4e