Skip to main content
Article thumbnail
Location of Repository

An overview of the recent progress on matrix multiplication

By Virginia Vassilevska Williams

Abstract

The exponent ω of matrix multiplication is the infimum over all real numbers c such that for all ε> 0 there is an algorithm that multiplies n × n matrices using at most O(nc+ε) arithmetic operations over an arbitrary field. A trivial lower bound on ω is 2, and the best known upper bound until recently was ω < 2.376 achieved by Coppersmith and Winograd in 1987. There were two independent improvements on ω, one by Stothers in 2010 who showed that ω < 2.374, and one by myself that ultimately resulted in ω < 2.373. Here I discuss the road to these improvements and conclude with some open questions.

Year: 2012
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.9865
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.eecs.berkeley.edu/~... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.