Code Generation for Polynomial Multiplication

Authors:
Ling Ding;Éric Schost
Affiliations:
ORCCA, Computer Science Department, The University of Western Ontario, London, Canada;ORCCA, Computer Science Department, The University of Western Ontario, London, Canada
Venue:
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Year:
2009

Citing 12
Cited 0

On fast multiplication of polynomials over arbitrary algebras

Acta Informatica
A new polynomial factorization algorithm and its implementation

Journal of Symbolic Computation
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Fast Algorithms for Manipulating Formal Power Series

Journal of the ACM (JACM)
Relax, but don't be too lazy

Journal of Symbolic Computation
Tellegen's principle into practice

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Modern Computer Algebra

Modern Computer Algebra
The Middle Product Algorithm I

Applicable Algebra in Engineering, Communication and Computing
Integer and polynomial multiplication: towards optimal toom-cook matrices

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Parallel sparse polynomial multiplication using heaps

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
A long note on Mulders' short product

Journal of Symbolic Computation
Algebraic Complexity Theory

Algebraic Complexity Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the family of "divide-and-conquer" algorithms for polynomial multiplication, that generalize Karatsuba's algorithm. We give explicit versions of transposed and short products for this family of algorithms and describe code generation techniques that result in high-performance implementations.