4 ms·
Is anyone looking into the memory accesses for the operation? Fifty years ago multiplication was vastly slower than RAM access. Nowadays it's pratically free c
by ableal 6y ago
Is anyone looking into the memory accesses for the operation?
Fifty years ago multiplication was vastly slower than RAM access. Nowadays it's pratically free compared to even getting data out of cache ...
- MauranKilom 6y agoNobody is remotely looking at running these algorithms in the real world. These are very much asymptotic complexities, and to draw benefit from even the 1990 version you'd have to literally use galactic input sizes. None of this is about making the matrix multiplications on your PC faster. https://en.wikipedia.org/wiki/Coppersmith%E2%80%93Winograd_algorithm https://en.wikipedia.org/wiki/Coppersmith%E2%80%93Winograd_a...
- soVeryTired 6y agoWikipedia says Strassen's algorithm is useful for n > 100 and is implemented in BLAS [0]. AFAIK Coppersmith-Winograd is more of a theoretical advance. Edit: ah, we're probably talking about the same thing. Strassen was 1970. [0] https://en.wikipedia.org/wiki/Matrix_multiplication_algorithm#Sub-cubic_algorithms https://en.wikipedia.org/wiki/Matrix_multiplication_algorith...