Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-27T07:09:33.897Z Has data issue: false hasContentIssue false
  • English
  • Français

Improved bound for complexity of matrix multiplication

Published online by Cambridge University Press:  18 March 2013

A. M. Davie  and
A. J. Stothers
A. M. Davie
Affiliation:
School of Mathematics, University of Edinburgh, King's Buildings, Mayfield Road, Edinburgh EH9 3JZ, UK ([email protected])
A. J. Stothers
Affiliation:
School of Mathematics, University of Edinburgh, King's Buildings, Mayfield Road, Edinburgh EH9 3JZ, UK ([email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
Proceedings of the Royal Society of Edinburgh Section A: Mathematics , Volume 143 , Issue 2 , April 2013 , pp. 351 - 369
Copyright
Copyright © Royal Society of Edinburgh 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)