Strassen algorithm
Algoritmo de Strassen
- Date
- 1969 · confidence high
- Place
- Zurich, Switzerland
- Credited to
- Volker Strassen
- Field
- Knowledge & symbols
What it is
An algorithm for multiplying matrices faster than the classical method, with asymptotic complexity O(n^log₂7); the first of the so-called fast linear-algebra algorithms.
What it led to
- Fast computational linear algebra
- Theoretical complexity bounds for matrix multiplication
- Even faster later algorithms (Coppersmith–Winograd and successors)