Multiplication algorithm: Difference between revisions

Content deleted Content added
Schönhage–Strassen: Better description
Line 406:
What is important, is to make subproblems of equal size. Using even and odd indexes, give subproblems of same size.
 
It hanhas an time complexity of O(''n'' log(''n'') log(log(''n''))).
 
==== History ====