articleMay 19, 2012Closed access

Multiplying matrices faster than coppersmith-winograd

VVVirginia Vassilevska Williams

University of California, Berkeley · Stanford University

Indexed incrossref

Abstract

We develop an automated approach for designing matrix multiplication algorithms based on constructions similar to the Coppersmith-Winograd construction. Using this approach we obtain a new improved bound on the matrix multiplication exponent ω

Citation impact

887
total citations
FWCI
123.23
Percentile
100%
References
20
Citations per year

Authors

1

Topics & keywords

Topics
Keywords
  • Matrix multiplication
  • Multiplication (music)
  • Exponent
  • Arithmetic
  • Matrix (chemical analysis)
  • Mathematics
  • Sparse matrix
  • Matrix algebra
No related works found for this paper.