Fast interpolation of sparse multivariate polynomials
Symbolic Computation
2024-01-01 v1 Commutative Algebra
Abstract
Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers. The problem of sparse interpolation is to recover f in its usual sparse representation, as a sum of coefficients times monomials. For the first time we present a quasi-optimal algorithm for this task.
Cite
@article{arxiv.2312.17664,
title = {Fast interpolation of sparse multivariate polynomials},
author = {Joris van der Hoeven and Grégoire Lecerf},
journal= {arXiv preprint arXiv:2312.17664},
year = {2024}
}