Multiplying Matrices Faster Than Coppersmith-Winograd

STOC（2012）

引用 1162|浏览613

暂无评分

摘要

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 omega < 2.3727.

查看译文

关键词

matrix multiplication

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要