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

Authors

70

  1. VV
    Virginia Vassilevska Williams

    Stanford University, United States

    2 publications · 51 citations

    2

    h-index

  2. AN
    Alexandru Nicolau

    University of California, Irvine, United States

    2 publications · 49 citations

    2

    h-index

  3. OS
    Oded Schwartz

    University of California, Berkeley, United States

    2 publications · 43 citations

    2

    h-index

  4. LW
    Leiou Wang

    Institute of Acoustics, China

    2 publications · 39 citations

    2

    h-index

  5. FS
    Frédéric Suter

    Centre National de la Recherche Scientifique, France

    2 publications · 43 citations

    2

    h-index

1–5 of 70

Venues

  1. ACM Transactions on Mathematical Software

    TOMS · 3 publications · 89 citations

    3

    h-index

  2. Algorithms

    2 publications · 39 citations

    2

    h-index

  3. Numerische Mathematik

    1 publications · 40 citations

    1

    h-index

  4. IEEE Transactions on Computers

    1 publications · 10 citations

    1

    h-index

  5. 1

    h-index

1–5