Martin Fürer
ABSTRACT
For more than 35 years, the fastest known method for integer multiplication has been the Schönhage-Strassen algorithm running in time O(n log n log log n). Under certain restrictive conditions there is a corresponding Ω(n log n) lower bound. The prevailing conjecture has always been that the complexity of an optimal algorithm is Θ(n log n). We present a major step towards closing the gap from above by presenting an algorithm running in time n log n, 2O(log* n).
The main result is for boolean circuits as well as for multitape Turing machines, but it has consequences to other models of computation as well.
- A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974. Google Scholar
Digital Library
- S.A. Cook and S.O. Aanderaa. On the minimum computation time of functions. Transactions of the AMS, 142:291--314, 1969.Google ScholarCross Ref
- J.W. Cooley and J.W. Tukey. An algorithm for the machine calculation of complex fourier series. Math. of Comput., 19:297--301, 1965.Google ScholarCross Ref
- 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.Google Scholar
- 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.Google Scholar
- A. Karatsuba and Y. Ofman. Multiplication of multidigit numbers on automata. Doklady Akademii Nauk SSSR, 145(2):293--294, 1962. (in Russian). English translation in Soviet Physics-Doklady 7, 595--596,1963.Google Scholar
- D.E. Knuth. The Art of Computer Programming, Volume 2, Seminumerical Algorithms. Addison-Wesley, Reading, MA, USA, third edition, 1998. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- C.H. Papadimitriou. Optimality of the fast Fourier transform. Journal of the ACM, 26(1):95--102, Jan. 1979. Google ScholarDigital Library
- M. Paterson, M. Fischer, and A. Meyer. An improved overlap argument for on-line multiplication. Technical Report 40, Project MAC, MIT, January 1974. Google ScholarDigital Library
- A. Schönhage. Multiplikation groşer Zahlen. Computing, 1(3):182--196, 1966.Google ScholarCross Ref
- A. Schönhage. Storage modification machines. SIAM J. Comput., 9(3):490--508, August 1980.Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google Scholar
- A. Schönhage and V. Strassen. Schnelle Multiplikation grosser Zahlen. Computing, 7:281--292, 1971.Google ScholarCross Ref
- 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.Google Scholar
Index Terms
- Faster integer multiplication
Recommendations
Fast integer multiplication using modular arithmetic
STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computingWe give an O(N • log N • 2O(log*N)) algorithm for multiplying two N-bit integers that improves the O(N • log N • log log N) algorithm by Schönhage-Strassen. Both these algorithms use modular arithmetic. Recently, Fürer gave an O(N • log N • 2O(log*N)) ...
Faster Integer Multiplication
For more than 35 years, the fastest known method for integer multiplication has been the Schönhage-Strassen algorithm running in time $O(n\log n\log\log n)$. Under certain restrictive conditions, there is a corresponding $\Omega(n\log n)$ lower bound. ...
Even faster integer multiplication
We give a new algorithm for the multiplication of n -bit integers in the bit complexity model, which is asymptotically faster than all previously known algorithms. More precisely, we prove that two n -bit integers can be multiplied in time O ( n log n K ...
Comments