Code Generation for Polynomial Multiplication

DOI10.1007/978-3-642-04103-7_6zbMath1260.68478OpenAlexW1609212254MaRDI QIDQ3644088

Éric Schost, Ling Ding

Publication date: 10 November 2009

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04103-7_6

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomials, factorization in commutative rings (13P05)

Uses Software

• Magma
• NTL
• mpFq

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On fast multiplication of polynomials over arbitrary algebras
• The Magma algebra system. I: The user language
• On short multiplications and divisions
• Relax, but don't be too lazy
• The middle product algorithm. I: Speeding up the division and square root of power series
• A new polynomial factorization algorithm and its implementation
• Fast multiplication of large numbers
• A long note on Mulders' short product
• Parallel sparse polynomial multiplication using heaps
• Modular Multiplication Without Trial Division
• Fast Algorithms for Manipulating Formal Power Series
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: Code Generation for Polynomial Multiplication