by Soubhik Chakraborty and Kiran Kumar Sundararajan.

Abstract:
Given that the statistical approach "weighs" rather than counts the computing operations which arguably makes it more realistic(see Chakraborty et. al. Appl. Math. Lett. 13(5), 2000 and InterStat Dec2004), 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.