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 ω<2.3727.
No takes yet. Share an insight, caveat, or question.
Virginia Vassilevska Williams (2012) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: