An Upper Bound of 9/4 for the Matrix Multiplication Exponent
For every , two complex matrices can be multiplied using scalar arithmetic operations, and in particular the matrix multiplication exponent over satisfies .
The proof cleanly combines the diagonal growth bound, polynomial interpolation upper bound, detecting characters, and standard recursive block-matrix multiplication to establish nu <= 9/4 and omega <= 9/4.
“Theorem 1.1. For every ε > 0, two n × n complex matrices can be multiplied using Oε(n 9/4+ε ) arithmetic operations. In particular, ω ≤ 9/4.” · Show in paper