A long note on Mulders' short product
From MaRDI portal
Publication:2643515
DOI10.1016/j.jsc.2003.03.001zbMath1161.65301MaRDI QIDQ2643515
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
65B10: Numerical summation of series
Related Items
Fast convolutions meet Montgomery, 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, Newton's method and FFT trading, 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
Cites Work