@article {MATHEDUC.02368647,
author = {Chakraborty, Soubhik and Sundararajan, Kiran Kumar},
title = {A statistical adventure towards getting an empirical $O(n^2)$ complexity in nxn matrix multiplication.},
year = {2006},
journal = {InterStat},
number = {3},
issn = {1941-689X},
pages = {7 p.},
publisher = {,},
abstract = {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.)},
msc2010 = {K90xx},
identifier = {2006e.03257},
}