Barriers for fast matrix multiplication from irreversibility
Barriers for fast matrix multiplication from irreversibility
Determining the asymptotic algebraic complexity of matrix multiplication, succinctly represented by the matrix multiplication exponent $\omega$, is a central problem in algebraic complexity theory. The best upper bounds on $\omega$, leading to the state-of-the-art $\omega \leq 2.37..$, have been obtained via Strassen's laser method and its generalization by Coppersmith and …