id: 02368647
dt: j
an: 2006e.03257
au: Chakraborty, Soubhik; Sundararajan, Kiran Kumar
ti: A statistical adventure towards getting an empirical $O(n^2)$ complexity in
nxn matrix multiplication.
so: InterStat, No. 3, 7 p. (2006).
py: 2006
pu: ,
la: EN
cc: K90
ut: Winograd algorithm; empirical O(nsup2) complexity
ci:
li:
ab: 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.)
rv: