3 ms·
It seems to be mentioned in the article: "[...]and the Schönhage–Strassen algorithm (1971) is even faster, for sufficiently large n." https://en.wikipedia.org
by ranie93 7y ago
It seems to be mentioned in the article:
"[...]and the Schönhage–Strassen algorithm (1971) is even faster, for sufficiently large n."
https://en.wikipedia.org/wiki/Sch%C3%B6nhage%E2%80%93Strassen_algorithm https://en.wikipedia.org/wiki/Sch%C3%B6nhage%E2%80%93Strasse...
- jwilk 7y agoSchönhage–Strassen is O(n · log n · log log n).