\input zb-basic
\input zb-matheduc
\iteman{ZMATH 2006e.03378}
\itemau{Kumar Sourabh, Suman; Chakraborty, Soubhik}
\itemti{Empirical $O(n^2$) complexity is convincingly gettable with two dense matrices in nxn matrix multiplication!}
\itemso{InterStat, No. 5, 9 p. (2006).}
\itemab
The present paper shows that Empirical $O(n^2$) Complexity is convincingly gettable with two dense matrices in nxn matrix multiplication. (orig.)
\itemrv{~}
\itemcc{P20 N30}
\itemut{Amir Schoor algorithm; sparse matrices; dense matrices; average case complexity}
\itemli{}
\end