2 ms·
It looks like you also turned the rest of your post into a link. The best currently known exponent for square matrix multiplication is around 2.3728; Wikipedia
by tmyklebu 9y ago
It looks like you also turned the rest of your post into a link.
The best currently known exponent for square matrix multiplication is around 2.3728; Wikipedia's page on matrix multiplication has a reference.
- ChrisRackauckas 9y ago>However, the constant coefficient hidden by the Big O notation is so large that these algorithms are only worthwhile for matrices that are too large to handle on present-day computers. No wonder I never heard about these. I updated it for correctness (and fixed the link, ugh) but yeah, these are details I'd hope to not dwell on in the post since for all intents and purposes you'd still never want to do the worst fallback unless you have to.
- tmyklebu 9y agoYep. (Largely) irrelevant in practice. But the gap between what we can do and what lower bounds we can prove is very large indeed for many matrix operations.