Computational complexity of matrix multiplication: Difference between revisions

Content deleted Content added
m Ce
Line 29:
| title = Faster Matrix Multiplication via Asymmetric Hashing
| class=cs.DS
}}</ref> However, this and similar improvements to Strassen are not used in practice, because they are [[galactic algorithm]]s: the constant coefficient hidden by the [[Bigbig O notation]] is so large that they are only worthwhile for matrices that are too large to handle on present-day computers.<ref>{{cite journal
| last = Iliopoulos
| first = Costas S.