Probably faster multiplication of sparse polynomials
Symbolic Computation
2025-08-25 v1
Abstract
In this paper, we present a probabilistic algorithm to multiply two sparse polynomials almost as efficiently as two dense univariate polynomials with a result of approximately the same size. The algorithm depends on unproven heuristics that will be made precise. Non-heuristic versions that are a constant times slower are also presented.
Keywords
Cite
@article{arxiv.2508.16164,
title = {Probably faster multiplication of sparse polynomials},
author = {Joris van der Hoeven},
journal= {arXiv preprint arXiv:2508.16164},
year = {2025}
}