Skip to main content Accesibility Help

Improved bound for complexity of matrix multiplication

  • A. M. Davie (a1) and A. J. Stothers (a1)

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.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Proceedings of the Royal Society of Edinburgh Section A: Mathematics
  • ISSN: 0308-2105
  • EISSN: 1473-7124
  • URL: /core/journals/proceedings-of-the-royal-society-of-edinburgh-section-a-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed