Abstract
Given that the statistical approach “weighs” rather than counts the computing operations which arguably makes it more realistic (see [Soubhik Chakraborty, Pabitra Pal Choudhury, A statistical analysis of an algorithm’s complexity, Applied Mathematics Letters 13 (5) (2000); Soubhik Chakraborty et al., On how statistics provides a reliable and valid measure for an algorithm’s complexity, InterStat Dec2004#2 ( http://interstat.statjournals.net/)]), we revisit Winograd’s algorithm statistically with the objective of getting an empirical O( n 2) complexity in two n × n matrix multiplication ( n even). Next we briefly analyze our findings.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
