Faster polynomial multiplication via multipoint Kronecker substitution
Symbolic Computation
2007-12-27 v1 Data Structures and Algorithms
Abstract
We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderately sized input polynomials, the new algorithms improve on the performance of the standard Kronecker substitution by a sizeable constant, both in theory and in empirical tests.
Cite
@article{arxiv.0712.4046,
title = {Faster polynomial multiplication via multipoint Kronecker substitution},
author = {David Harvey},
journal= {arXiv preprint arXiv:0712.4046},
year = {2007}
}
Comments
14 pages, 4 figures