282 citations · 531 across the 15 of their papers we have counts for
1 paper · 2 filters
Gal Beniamini, Nathan Cheng, Olga Holtz +2
Fast matrix multiplication algorithms may be useful, provided that their running time is good in practice. Particularly, the leading coefficient of their arithmetic complexity need…