2 ms·
No he didn't, he just proved the wellknown and widely implemented Schoenhage–Strassen conjecture from 1971 to be correct. Which was O(n log log n), now impleme
by rurban 7y ago
No he didn't, he just proved the wellknown and widely implemented Schoenhage–Strassen conjecture from 1971 to be correct.
Which was O(n log log n), now implemented for O(n log n).
Schoenhage–Strassen is used for multiplying large numbers with >30.000 digits. Below Karatsuba is used, and for >trillion digits Fuerer could be used. What he did was to improve Fuerer's method from 2007, nobody is using yet.
https://en.wikipedia.org/wiki/F%C3%BCrer%27s_algorithm https://en.wikipedia.org/wiki/F%C3%BCrer%27s_algorithm