Integer and polynomial multiplication: towards optimal toom-cook matrices
暂无分享,去创建一个
[1] Marco Bodrato,et al. What About Toom-Cook Matrices Optimality ? , 2006 .
[2] Tom St Denis,et al. Multi-Precision Math , 2007 .
[3] M. Anwar Hasan,et al. Asymmetric Squaring Formulae , 2007, 18th IEEE Symposium on Computer Arithmetic (ARITH '07).
[4] Tommy Färnqvist. Number Theory Meets Cache Locality – Efficient Implementation of a Small Prime FFT for the GNU Multiple Precision Arithmetic Library , 2005 .
[5] Anatolij A. Karatsuba,et al. Multiplication of Multidigit Numbers on Automata , 1963 .
[6] David Thomas,et al. The Art in Computer Programming , 2001 .
[7] Arnold Schönhage,et al. Schnelle Multiplikation großer Zahlen , 1971, Computing.
[8] S. Cook,et al. ON THE MINIMUM COMPUTATION TIME OF FUNCTIONS , 1969 .
[9] Pierrick Gaudry,et al. A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm , 2007, ISSAC '07.
[10] Donald Ervin Knuth,et al. The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .
[11] Dan Zuras. More On Squaring and Multiplying Large Integers , 1994, IEEE Trans. Computers.
[12] Marco Bodrato,et al. Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0 , 2007, WAIFI.