Editing Strassen algorithm (section)

== See also ==
* [[Computational complexity of mathematical operations]]
* [[Gauss–Jordan elimination]]
* [[Computational complexity of matrix multiplication]]
* [[Z-order curve]]
* [[Karatsuba algorithm]], for multiplying ''n''-digit integers in <math>O(n^{\log_2 3})</math> instead of in <math>O(n^2)</math> time
** A similar [[Multiplication algorithm#Complex number multiplication|complex multiplication algorithm]] multiplies two complex numbers using 3 real multiplications instead of 4
* [[Toom–Cook multiplication|Toom-Cook algorithm]], a faster generalization of the Karatsuba algorithm that permits recursive divide-and-conquer decomposition into more than 2 blocks at a time