Multiplying matrices faster than coppersmith-winograd

Full Paper: Search Google Scholar
By Virginia Vassilevska Williams | published 2012-05-19 | 1 | Share:     Report a problem
 
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 &#969;<2.3727.
 
Suggested Reading
v
There are no publications to display.

Suggest a relevant paper:
Title *
Authors Pub year

 
 

Discussion


Post anonymously: (You can change the anonymity of a comment at any time.)

You must be logged in to comment. Log in


No comments yet.



Auto-Topics:
  • topics are currently being processed...
+ add a topic:
Thoughts, suggestions, comments, problems? Email feedback@science.io