On the bit-complexity of sparse polynomial multiplication

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In 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.

Keywords

Data Structures and Algorithms, Mathematical Software, I.1.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/217620

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0901.4323
 http://arxiv.org/abs/0901.4323

Collections

arXiv