Strassen Algorithm

7 recursive calls in size $n/2+\Theta (n^2)$ additions → $T(n)=\Theta (n^{lo{g}_2(7)})$

Related

• Karatsuba Algorithm