A long note on Mulders' short product

DOI10.1016/J.JSC.2003.03.001MaRDI QIDQ2643515zbMATH OpenOpenAlexFDO

Authors Guillaume Hanrot, Paul Zimmermann

Publication date 24 August 2007

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00071931/file/RR-4654.pdf

zbMATH Keywords

Karatsuba modelMulders' algorithm

Mathematics Subject Classification ID

Numerical summation of series (65B10)

Recommendations

• On short multiplications and divisions
• Fast multiplication and its applications
• The middle product algorithm. I: Speeding up the division and square root of power series
• scientific article; zbMATH DE number 1253958
• Five, six, and seven-term Karatsuba-like formulae

Cites work

• On short multiplications and divisions

Cited in

(11)

• A probabilistic algorithm for verifying polynomial middle product in linear time
• Corrigendum to ``A long note on Mulders' short product
• New algorithms for relaxed multiplication
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• Code Generation for Polynomial Multiplication
• A note on the paper ``Multiplication of polynomials modulo \(x^n\) by Murat Cenk and Ferruh Özbudak
• A simple and fast online power series multiplication and its analysis
• Fast convolutions meet Montgomery
• Computing clipped products
• A question of Muir and Littlewood's products
• Newton's method and FFT trading

This page was built for publication: A long note on Mulders' short product

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643515)