History


Help on query formulation
Empirical $O(n^2$) complexity is convincingly gettable with two dense matrices in nxn matrix multiplication! (English)
InterStat, No. 5, 9 p. (2006).
The present paper shows that Empirical $O(n^2$) Complexity is convincingly gettable with two dense matrices in nxn matrix multiplication. (orig.)
Classification: P20 N30
Valid XHTML 1.0 Transitional Valid CSS!