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.

Me gusta

Guardar

Me gusta

Guardar

Cite This Study

Virginia Vassilevska Williams (Sat,) studied this question.

synapsesocial.com/papers/69da15f7b48bb130d4684073 https://doi.org/https://doi.org/10.1145/2213977.2214056

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Matrix multiplication via arithmetic progressions1990 · 2,303 citations
2On Sets of Integers Which Contain No Three Terms in Arithmetical Progression1942 · 138 citations
3Relative bilinear complexity and matrix multiplication.1987 · 151 citations
4Intersection Theorems for Systems of Sets1960 · 638 citations
5Gaussian elimination is not optimal1969 · 2,526 citations

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Matrix multiplication via arithmetic progressions1990 · 2,303 citations
2On Sets of Integers Which Contain No Three Terms in Arithmetical Progression1942 · 138 citations
3Relative bilinear complexity and matrix multiplication.1987 · 151 citations
4Intersection Theorems for Systems of Sets1960 · 638 citations
5Gaussian elimination is not optimal1969 · 2,526 citations