DocumentCode :
2187277
Title :
On the asymptotic complexity of matrix multiplication
Author :
Coppersmith, D. ; Winograd, S.
fYear :
1981
fDate :
28-30 Oct. 1981
Firstpage :
82
Lastpage :
90
Abstract :
The main results of this paper have the following flavor: given one algorithm for multiplying matrices, there exists another, better, algorithm. A consequence of these results is that ω, the exponent for matrix multiplication, is a limit point, that is, cannot be realized by any single algorithm. We also use these results to construct a new algorithm which shows that ω ≪ 2.495364.
Keywords :
Arithmetic; Equations; Tensile stress;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1981. SFCS '81. 22nd Annual Symposium on
Conference_Location :
Nashville, TN, USA
ISSN :
0272-5428
Type :
conf
DOI :
10.1109/SFCS.1981.27
Filename :
4568320
Link To Document :
بازگشت