Daniel S. Roche

Interpolation of Shifted-Lacunary Polynomials

Abstract.Given a “black box” function to evaluate an unknown rational polynomial

Faster sparse multivariate polynomial interpolation of straight-line programs

f \in {\mathbb{Q}}[x]

Multivariate sparse interpolation using randomized Kronecker substitutions

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

Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication

t \in {\mathbb{Z}}_{>0}

Computing Sparse Multiples of Polynomials

, the shift