Fast interpolation of multivariate polynomials with sparse exponents
type: Item
instance of: scholarly article
title: Fast interpolation of multivariate polynomials with sparse exponents
author: Joris van der Hoeven
author: Grégoire Lecerf
published in: Journal of Complexity
publication date: 2025-01-17T00:00:00Z
Mathematics Subject Classification ID: 14Q20
Mathematics Subject Classification ID: 65D05
Mathematics Subject Classification ID: 68W01
zbMATH DE Number: 7969296
zbMATH Keywords: sparse polynomial interpolation
zbMATH Keywords: computer algebra
zbMATH Keywords: complexity
zbMATH Keywords: algorithm
MaRDI profile type: Publication
cites work: PRIMES is in P
cites work: Sparse interpolation over finite fields via low-order roots of unity
cites work: Faster sparse multivariate polynomial interpolation of straight-line programs
cites work: Multivariate sparse interpolation using randomized Kronecker substitutions
cites work: Sparse polynomial arithmetic with the BPAS library
cites work: Q4660643
cites work: Q4331740
cites work: Simultaneous Conversions with the Residue Number System Using Linear Algebra
cites work: Dagwood
cites work: Interpolation of polynomials given by straight-line programs
cites work: Modern computer algebra
cites work: Randomized root finding over finite FFT-fields using tangent Graeffe transforms
cites work: Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
cites work: Sparse polynomials in FLINT
cites work: Integer multiplication in time \(O(n\log n)\)
cites work: On the bit-complexity of sparse polynomial and series multiplication
cites work: Modular SIMD arithmetic in M <scp>athemagix</scp>
cites work: A Fast Parallel Sparse Polynomial GCD Algorithm
cites work: Q4875225
cites work: Sparse Polynomial Interpolation over Fields with Large or Zero Characteristic
cites work: Using sparse interpolation to solve multivariate diophantine equations
cites work: Sparse multivariate Hensel lifting: a high-performance design and implementation
cites work: Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation
cites work: Majorations Explicites Pour le Nombre de Diviseurs de N
cites work: What Can (and Can't) we Do with Sparse Polynomials?
cites work: Approximate formulas for some functions of prime numbers
cites work: Q4557502
cites work: The complexity of sparse polynomial interpolation over finite fields
DOI: 10.1016/J.JCO.2024.101922
description: scientific article; zbMATH DE number 7969296