HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Integer multiplication in time O(n log n)

Abstract : We present an algorithm that computes the product of two n-bit integers in O(n log n) bit operations, thus confirming a conjecture of Schönhage and Strassen from 1971. Our complexity analysis takes place in the multitape Turing machine model, with integers encoded in the usual binary representa- tion. Central to the new algorithm is a novel “Gaussian resampling” technique that enables us to reduce the integer multiplication problem to a collection of multidimensional discrete Fourier transforms over the complex numbers, whose dimensions are all powers of two. These transforms may then be evaluated rapidly by means of Nussbaumer’s fast polynomial transforms.
Complete list of metadata

Contributor : Joris van der Hoeven Connect in order to contact the contributor
Submitted on : Saturday, November 28, 2020 - 9:59:01 PM
Last modification on : Thursday, December 3, 2020 - 3:30:20 AM


Files produced by the author(s)


  • HAL Id : hal-02070778, version 2



David Harvey, Joris van der Hoeven. Integer multiplication in time O(n log n). Annals of Mathematics, Princeton University, Department of Mathematics, In press. ⟨hal-02070778v2⟩



Record views


Files downloads