CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search Fürer's algorithm is an integer multiplication algorithm for very large numbers possessing a very low asymptotic complexity . It was created in 2007 by Swiss mathematician Martin Fürer of Pennsylvania State University [1] as an asymptotically faster (when analysed on a multitape Turing machine ) algorithm than its predecessor, the Schönhage–Strassen algorithm published in 1971. [2] The predecessor to the Fürer algorithm, the Schönhage–Strassen algorithm, used fast Fourier transforms to compute integer products in time (in big O notation ) and its authors, Arnold Schönhage and Volker Strassen , also conjectured a lower bound for the problem of . Here, denotes the total number of bits in the two input numbers. Fürer's algorithm reduces the gap between these two bounds: it can be used to multi...