Sparse Polynomial Interpolation with Finitely Many Values for the Coefficients
Symbolic Computation
2017-06-23 v2
Abstract
In this paper, we give new sparse interpolation algorithms for black box polynomial f whose coefficients are from a finite set. In the univariate case, we recover f from one evaluation of f(a) for a sufficiently large number a. In the multivariate case, we introduce the modified Kronecker substitution to reduce the interpolation of a multivariate polynomial to the univariate case. Both algorithms have polynomial bit-size complexity.
Cite
@article{arxiv.1704.04359,
title = {Sparse Polynomial Interpolation with Finitely Many Values for the Coefficients},
author = {Qiao-Long Huang and Xiao-Shan Gao},
journal= {arXiv preprint arXiv:1704.04359},
year = {2017}
}