Faster integer multiplication

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 57-66

  Fürer, Martin ^a  

^a The Pennsylvania State University   (United States)

Author keywords

Complexity; Computer arithmetic; Discrete Fourier transform; FFT; Integer multiplication

Indexed keywords

BOOLEAN CIRCUITS; COMPUTER ARITHMETIC; INTEGER MULTIPLICATION;

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; NONLINEAR EQUATIONS;

DISCRETE FOURIER TRANSFORMS;

EID: 35448968883     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250800     Document Type: Conference Paper

References (18)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974.
2. S. A. Cook and S. O. Aanderaa. On the minimum computation time of functions. Transactions of the AMS, 142:291-314, 1969.
3. J. W. Cooley and J. W. Tukey. An algorithm for the machine calculation of complex fourier series. Math. of Comput., 19:297-301, 1965.
4. M. Fürer. On the complexity of integer multiplication, (extended abstract). Technical Report Technical report CS-89-17, Department of Computer Science, The Pennsylvania State University, 1989.
5. M. T. Heideman, D. H. Johnson, and C. S. Burrus. Gauss and the history of the FFT. IEEE Acoustics, Speech, and Signal Processing, 1:14-21, Oct. 1984.
6. A. Karatsuba and Y. Ofman. Multiplication of multidigit numbers on automata. Doklady Akademii Nauk SSSR, 145(2):293-294, 1962. (in Russian).
7. English translation in Soviet Physics-Doklady 7, 595-596, 1963.
8. D. E. Knuth. The Art of Computer Programming, Volume 2, Seminumerical Algorithms. Addison-Wesley, Reading, MA, USA, third edition, 1998.
9. J. Morgenstern. Note on a lower bound on the linear complexity of the fast Fourier transform. Journal of the ACM, 20(2):305-306, Apr. 1973.
10. V. Y. Pan. The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms. Information Processing Letters, 22(1):11-14, 2 Jan. 1986.
11. C. H. Papadimitriou. Optimality of the fast Fourier transform. Journal of the ACM, 26(1):95-102, Jan. 1979.
12. M. Paterson, M. Fischer, and A. Meyer. An improved overlap argument for on-line multiplication. Technical Report 40, Project MAC, MIT, January 1974.
13. A. Schönhage. Multiplikation großer Zahlen. Computing, 1(3):182-196, 1966.
14. A. Schönhage. Storage modification machines. SIAM J. Comput., 9(3):490-508, August 1980.
15. A. Schönhage. Asymptotically fast algorithms for the numerical multiplication and division of polynomials with complex coeficients. In J. Calmet, editor, Computer Algebra, EUROCAM '82, European Computer Algebra Conference, Marseille, France, 5-7 April, 1982, Proceedings, volume 144 of Lecture Notes in Computer Science, pages 3-15. Springer, 1982.
16. A. Schönhage, A. F. W. Grotefeld, and E. Vetter. Fast algorithms: A Turing machine implementation. B.I. Wissenschaftsverlag, Mannheim-Leipzig-Wien-Zürich, 1994.
17. A. Schönhage and V. Strassen. Schnelle Multiplikation grosser Zahlen. Computing, 7:281-292, 1971.
18. A. L. Toom. The complexity of a scheme of functional elements simulating the multiplication of integers. Dokl. Akad. Nauk SSSR, 150:496-498, 1963. (in Russian). English translation in Soviet Mathematics 3, 714-716, 1963.