Probably faster multiplication of sparse polynomials
Joris van der Hoeven · arXiv (Cornell University) · 2025
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.