Strassen algorithm [SEP] discoverer or inventor
Strassen algorithm
In linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm and is useful in practice for large matrices, but would be slower than the fastest known algorithms for extremely large matrices.
Strassen's algorithm works for any ring, such as plus/multiply, but not all semirings, such as min-plus or boolean algebra, where the naive algorithm still works, and so called combinatorial matrix multiplication.
History
settle the P versus NP problem and hence earn the discoverer a million dollar prize from the Clay Mathematics Institute.
Examples.
There are several well-known algorithms with world-beating asymptotic behavior, but only on impractically large problems:
- Matrix multiplication: The first improvement over brute-force multiplication, O("N") is the Strassen algorithm, a recursive algorithm that is O("N"). This algorithm is not galactic and used in practice. Further extensions of this, using sophisticated group theory, are the Coppersmith