Winograd's algorithm statistically revisited: it pays to weigh than to count!

DOI10.1016/j.amc.2007.01.018zbMath1243.68337OpenAlexW2008593641MaRDI QIDQ2383729

Kiran Kumar Sundararajan, Soubhik Chakraborty

Publication date: 19 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.01.018

zbMATH Keywords

Winograd's algorithmempirical \(O(n^{2})\) complexity

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Foundations and philosophical topics in statistics (62A01)

Cites Work

• Unnamed Item
• Unnamed Item
• A statistical analysis of an algorithm's complexity
• Replacement sort revisited: The ``gold standard unearthed!

This page was built for publication: Winograd's algorithm statistically revisited: it pays to weigh than to count!