1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.SC2026
Exploiting the Structure in Tensor Decompositions for Matrix Multiplication
Manuel Kauers, Jakob Moosbauer, Isaac Wood
We present a new algorithm for fast matrix multiplication using tensor decompositions which have special features. Thanks to these features we obtain exponents lower than what the…
cs.SC2022
Flip Graphs for Matrix Multiplication
Manuel Kauers, Jakob Moosbauer
We introduce a new method for discovering matrix multiplication schemes based on random walks in a certain graph, which we call the flip graph. Using this method, we were able to r…
cs.SC2022★ 1 cited
The FBHHRBNRSSSHK-Algorithm for Multiplication in is still not the end of the story
Manuel Kauers, Jakob Moosbauer
In response to a recent Nature article which announced an algorithm for multiplying -matrices over with only 96 multiplications, two fewer than the previou…