Fast interpolation of multivariate polynomials with sparse exponents - Laboratoire d'informatique de l'X (LIX)
Article Dans Une Revue Journal of Complexity Année : 2023

Fast interpolation of multivariate polynomials with sparse exponents

Résumé

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.
Fichier principal
Vignette du fichier
mvsparse-v3.pdf (399.93 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04366836 , version 1 (29-12-2023)
hal-04366836 , version 2 (03-04-2024)
hal-04366836 , version 3 (29-12-2024)

Identifiants

Citer

Joris van der Hoeven, Grégoire Lecerf. Fast interpolation of multivariate polynomials with sparse exponents. Journal of Complexity, 2023, 87, pp.101922. ⟨10.1016/j.jco.2024.101922⟩. ⟨hal-04366836v3⟩
108 Consultations
57 Téléchargements

Altmetric

Partager

More