Exponent of matrix multiplication complexity
edit on github · preview edits · show history · long url · complexity algorithms matrix multiplication
[2, 2.3728596]
$\omega$ is the smallest real number such that any two $n\times n$ matrices can be multiplied in $O(n^{\omega+\varepsilon})$ field operations for any $\varepsilon > 0$.
The trivial matrix multiplication algorithm runs in $O(n^3)$, which proves $2 \leq \omega \leq 3$.
This trivial upper bound was improved upon many times [4].
Strassen [2] proved $\omega \leq \log_2(7) \leq 2.8074$.
Alman and Vassilevska--Williams [1] proved the most recent bound $\omega \leq 2.3728596$.
Josh Alman and Virginia Vassilevska Williams, "A Refined Laser Method and Faster Matrix Multiplication", 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) (arXiv)
Volker Strassen, "Gaussian elimination is not optimal", Numerische Mathematik. 13 (4): 354-356, 1969. (doi)
Data properties
Entries are of type: real number
Sources of data: [1]