TY - GEN
T1 - Flip Graphs for Matrix Multiplication
AU - Kauers, Manuel
AU - Moosbauer, Jakob
PY - 2023/7/24
Y1 - 2023/7/24
N2 - 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 reduce the number of multiplications for the matrix formats (4,4,5) and (5,5,5), both in characteristic two and for arbitrary ground fields.
AB - 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 reduce the number of multiplications for the matrix formats (4,4,5) and (5,5,5), both in characteristic two and for arbitrary ground fields.
UR - https://www.scopus.com/pages/publications/85163884586
U2 - 10.1145/3597066.3597120
DO - 10.1145/3597066.3597120
M3 - Conference proceedings
T3 - ACM International Conference Proceeding Series
SP - 381
EP - 388
BT - Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Tromso, Norway, July 24-27, 2023
A2 - Alicia Dickenstein and Elias P. Tsigaridas and Gabriela Jeronimo, null
PB - ACM
ER -