Strassen-winograd Algorithm
The Strassen-Winograd Algorithm is a divide-and-conquer matrix multiplication algorithm that reduces the asymptotic complexity of dense matrix multiplication by employing a recursive decomposition scheme based on fewer scalar multiplications than the standard cubic-time approach.
29
Publications
1.5K
Citations
70
Authors
47
Institutions
Publications per year
2017–2026
8
Variants
Winograd's Variant Of Strassen's Algorithm
Parents
29
A Survey of Fast Exponentiation Methods
Daniel M. Gordon · Journal of Algorithms · 1998 · 534 citations
On cap sets and the group-theoretic approach to matrix multiplication
Jonah Blasiak, Thomas M. Church, Henry Cohn et al. · Discrete Analysis · 2017 · 96 citations · Full text
1–5 of 29
70
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 70
47

École Normale Supérieure de Lyon
Lyon, France
2 h-index
2 publications
43 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
5 publications
393 citations
Stanford University
Stanford, United States
2 h-index
2 publications
136 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
2 h-index
2 publications
43 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
4 publications
86 citations
University of California, Irvine
Irvine, United States
2 h-index
2 publications
49 citations

University of Waterloo
Waterloo, Canada
2 h-index
3 publications
66 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
2 publications
43 citations
1–8 of 47
TOMS · 3 publications · 89 citations
3
h-index
2 publications · 39 citations
2
h-index
1 publications · 40 citations
1
h-index
1 publications · 10 citations
1
h-index
1 publications · 25 citations
1
h-index
1–5