"A galactic algorithm is one that outperforms any other algorithm for problems that are sufficiently large, but where "sufficiently large" is so big that the algorithm is never used in practice."
Strassen algorithm works in $O(n^{2.8074})$. There is also the Coppersmith–Winograd algorithm which runs in $O(n^{2.37188})$,but it's a galactic algorithm. Are there any algorithms that outperform the Strassen algorithm with matrices smaller enough to be of any practical use?
