Date:
Monday, 8th April 2019
A/Prof. David Harvey and his collaborator Joris van der Hoeven have posted a HAL preprint that describes a new algorithm for multiplication of two $n$-bit integers in $O(n \log n)$ time. This surpasses the previously known complexity bounds in efficiency, confirming the 48-year old conjecture of Schönhage and Strassen.