施特拉森演算法 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "施特拉森演算法" in Chinese language version.

refsWebsite

Global rank Chinese rank

179^th place

275^th place

1web.archive.org

1^st place

1^st place

stanford.edu

cs.stanford.edu

Virginia Vassilevska Williams. Multiplying matrices faster than Coppersmith-Winograd (PDF). [2014-01-14]. （原始内容存档 (PDF)于2013-10-08）. 而1990年Coppersmith-Winograd方法提出时的算法复杂度为 $O(n^{2.3727})$ 。

web.archive.org

Virginia Vassilevska Williams. Multiplying matrices faster than Coppersmith-Winograd (PDF). [2014-01-14]. （原始内容存档 (PDF)于2013-10-08）. 而1990年Coppersmith-Winograd方法提出时的算法复杂度为 $O(n^{2.3727})$ 。