On the bit-complexity of sparse polynomial multiplication

Simple item page
dc.creatorvan der Hoeven, Joris
dc.creatorLecerf, Grégoire
dc.date2009-01-26
dc.date.accessioned2026-07-07T12:34:56Z
dc.date.available2026-07-07T12:34:56Z
dc.descriptionIn this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity results for the power series multiplication in many variables. Our algorithms are implemented and freely available within the Mathemagix software. We show that their theoretical costs are well-reflected in practice.
dc.identifierhttps://arxiv.org/abs/0901.4323
dc.identifierhttp://arxiv.org/abs/0901.4323
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/217620
dc.subjectData Structures and Algorithms
dc.subjectMathematical Software
dc.subjectI.1.2
dc.titleOn the bit-complexity of sparse polynomial multiplication
dc.typetext

Files

Collections

arXiv