
02368647
j
2006e.03257
Chakraborty, Soubhik
Sundararajan, Kiran Kumar
A statistical adventure towards getting an empirical $O(n^2)$ complexity in nxn matrix multiplication.
InterStat, No. 3, 7 p. (2006).
2006
,
EN
K90
Winograd algorithm
empirical O(nsup2) complexity
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.)