Consequences of the Moosbauer-Poole Algorithms
ACM Communications in Computer Algebra · 01.12.2025 · 59 (4) · 74-76
DOI: 10.1145/3832046.3832048 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Communications in Computer Algebra, online erschienen am 18.08.2026. Verfasst von Manuel Kauers und 1 weiteren Autor:innen. Die Arbeit nennt 7 Literaturangaben.
Abstract (Originalsprache)
Moosbauer and Poole have recently shown that the multiplication of two 5 × 5 matrices requires no more than 93 multiplications in the (possibly non-commutative) coefficient ring, and that the multiplication of two 6 × 6 matrices requires no more than 153 multiplications. Taking these multiplication schemes as starting points, we found improved matrix multiplication schemes for various rectangular matrix formats using a flip graph search.
Zitieren
APA
Kauers, M., & Wood, I. (2025). Consequences of the Moosbauer-Poole Algorithms. ACM Communications in Computer Algebra, 59(4), 74-76. https://doi.org/10.1145/3832046.3832048
Vancouver
Kauers M, Wood I. Consequences of the Moosbauer-Poole Algorithms. ACM Communications in Computer Algebra. 2025;59(4):74-76. doi:10.1145/3832046.3832048
BibTeX
@article{Kauers2025,
author = {Kauers, Manuel and Wood, Isaac},
title = {Consequences of the Moosbauer-Poole Algorithms},
journal = {ACM Communications in Computer Algebra},
year = {2025},
volume = {59},
number = {4},
pages = {74--76},
doi = {10.1145/3832046.3832048}
}
EUVIMED