Abstract

Given a “black box” function to evaluate an unknown rational polynomial f ∈ Q[x] at points modulo a prime p, we exhibit algorithms to compute the representation of the polynomial in the sparsest shifted power basis. That is, we determine the sparsity t ∈ Z>0, the shift α ∈ Q, the exponents 0 ≤ e1 <e2 < ·· · <et, and the coefficients c1,...,ct ∈ Q \{0} such that f(x) =c1(x − α) e1 + c2(x − α) e2 + ···+ ct(x − α) et. The computed sparsity t is absolutely minimal over any shifted power basis. The novelty of our algorithm is that the complexity is polynomial in the (sparse) representation size, which may be logarithmic in the degree of f. Our method combines previous celebrated results on sparse interpolation and computing sparsest shifts, and provides a way to handle polynomials with extremely high degree which are, in some sense, sparse in information.

Citations