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.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.
* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.
Usage data cannot currently be displayed