Complexity Lower Bounds of Small Matrix Multiplication over Finite Fields via Backtracking and Substitution
This paper presents a novel automated method combining the substitution technique with systematic backtracking and dynamic programming to prove that the bilinear complexity of matrix multiplication over is at least 20, thereby improving the previous lower bound of 19.