Computer-Aided Discovery of a Fast Matrix-Multiplication Algorithm.
Johnson,Rodney W, Aileen M. McLoughlin · Defense Technical Information Center (DTIC) · 1979
A computer program was written that searches for fast matrix-multiplication algorithms by seeking roots of a certain multivariate polynomial. An algorithm was discovered that, like the one discovered by Laderman, uses 23 noncommutative multiplications in multiplying 3-by-3 matrices. The new algorithm is demonstrably inequivalent to Laderman's in a sense that is made precise. (Author)