Help on query formulation
A statistical adventure towards getting an empirical $O(n^2)$ complexity in nxn matrix multiplication. (English)
InterStat, No. 3, 7 p. (2006).
Given that the statistical approach "weighs" rather than counts the computing operations which arguably makes it more realistic, we revisit Winograd’s algorithm statistically with the objective of getting an empirical $O(n^2)$ complexity in two nxn matrix multiplication (n even). Next we briefly analyze our findings. (orig.)
Classification: K90
Valid XHTML 1.0 Transitional Valid CSS!