24 citations · 28 across the 7 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
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…
cs.CC2022
A Normal Form for Matrix Multiplication Schemes
Manuel Kauers, Jakob Moosbauer
Schemes for exact multiplication of small matrices have a large symmetry group. This group defines an equivalence relation on the set of multiplication schemes. There are algorithm…