Complexity Lower Bounds of Small Matrix Multiplication over Finite Fields via Backtracking and Substitution
arXiv:2603.07280v1 Announce Type: new Abstract: We introduce a new method for proving bilinear complexity lower bounds for matrix multiplication over finite fields. The approach combines...