A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Designing Strassen's algorithm
[article]
2017
arXiv
pre-print
In 1969, Strassen shocked the world by showing that two n x n matrices could be multiplied in time asymptotically less than O(n^3). While the recursive construction in his algorithm is very clear, the key gain was made by showing that 2 x 2 matrix multiplication could be performed with only 7 multiplications instead of 8. The latter construction was arrived at by a process of elimination and appears to come out of thin air. Here, we give the simplest and most transparent proof of Strassen's
arXiv:1708.09398v1
fatcat:i7txv335gnbexjakfc7dl2euoa