
02369569
j
2006e.03378
Kumar Sourabh, Suman
Chakraborty, Soubhik
Empirical $O(n^2$) complexity is convincingly gettable with two dense matrices in nxn matrix multiplication!
InterStat, No. 5, 9 p. (2006).
2006
,
EN
P20
N30
Amir Schoor algorithm
sparse matrices
dense matrices
average case complexity
The present paper shows that Empirical $O(n^2$) Complexity is convincingly gettable with two dense matrices in nxn matrix multiplication. (orig.)