Faster polynomial multiplication via multipoint Kronecker substitution

Simple item page
dc.creatorHarvey, David
dc.date2007-12-25
dc.date.accessioned2026-07-07T08:51:17Z
dc.date.available2026-07-07T08:51:17Z
dc.descriptionWe 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.
dc.description14 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/0712.4046
dc.identifierhttp://arxiv.org/abs/0712.4046
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144883
dc.subjectSymbolic Computation
dc.subjectData Structures and Algorithms
dc.titleFaster polynomial multiplication via multipoint Kronecker substitution
dc.typetext

Files

Collections

arXiv