2013/03/18 by A. M. Davie, Andrew James Stothers · 2 citations
Computer Science · Engineering · Mathematics · Chemistry · #Complexity and Algorithms in Graphs #Coding theory and cryptography #graph theory and CDMA systems #Matrix multiplication #Exponent #Extension (predicate logic) #Upper and lower bounds #Multiplication (music) #Exposition (narrative) #Mathematics #Matrix (chemical analysis) #Discrete mathematics #Arithmetic #Computer science #Combinatorics #Physics #Chemistry #Mathematical analysis #Quantum mechanics
paper · doi:10.1017/s0308210511001648
openalex publication_date 2013/03/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/09
We give a new bound ω < 2.37369 for the exponent of complexity of matrix multiplication, giving a small improvement on the previous bound obtained by Coppersmith and Winograd. The proof involves an extension of the method used by these authors. We have attempted to make the exposition self-contained.