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.
No takes yet. Share an insight, caveat, or question.
Davie et al. (2013) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: