Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Karstadt, Elaye"'
Fast matrix multiplication algorithms may be useful, provided that their running time is good in practice. Particularly, the leading coefficient of their arithmetic complexity needs to be small. Many sub-cubic algorithms have large leading coefficien
Externí odkaz:
http://arxiv.org/abs/2008.03759
Autor:
KARSTADT, ELAYE1, SCHWARTZ, ODED1
Publikováno v:
Journal of the ACM. Jan2020, Vol. 67 Issue 1, p1-31. 31p.