https://arxiv.org/abs/2210.04045 close this message Accessible arXiv Do you navigate arXiv using a screen reader or other assistive technology? Are you a professor who helps students do so? We want to hear from you. Please consider signing up to share your insights as we work to make arXiv even more open. Share Insights Skip to main content Cornell University We gratefully acknowledge support from the Simons Foundation and member institutions. arxiv logo > cs > arXiv:2210.04045 [ ] Help | Advanced Search [All fields ] Search arXiv logo Cornell University Logo [ ] GO quick links * Login * Help Pages * About Computer Science > Symbolic Computation arXiv:2210.04045 (cs) [Submitted on 8 Oct 2022 (v1), last revised 11 Oct 2022 (this version, v2)] Title:The FBHHRBNRSSSHK-Algorithm for Multiplication in $\mathbb{Z}_2 ^{5\times5}$ is still not the end of the story Authors:Manuel Kauers, Jakob Moosbauer Download PDF Abstract: In response to a recent Nature article which announced an algorithm for multiplying $5\times5$-matrices over $\mathbb{Z} _2$ with only 96 multiplications, two fewer than the previous record, we present an algorithm that does the job with only 95 multiplications. Subjects: Symbolic Computation (cs.SC); Computational Complexity (cs.CC) Cite as: arXiv:2210.04045 [cs.SC] (or arXiv:2210.04045v2 [cs.SC] for this version) https://doi.org/10.48550/arXiv.2210.04045 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Manuel Kauers [view email] [v1] Sat, 8 Oct 2022 15:04:25 UTC (6 KB) [v2] Tue, 11 Oct 2022 04:28:00 UTC (6 KB) Full-text links: Download: * PDF * PostScript * Other formats (license) Current browse context: cs.SC < prev | next > new | recent | 2210 Change to browse by: cs cs.CC References & Citations * NASA ADS * Google Scholar * Semantic Scholar a export bibtex citation Loading... Bibtex formatted citation x [loading... ] Data provided by: Bookmark BibSonomy logo Mendeley logo Reddit logo ScienceWISE logo (*) Bibliographic Tools Bibliographic and Citation Tools [ ] Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) [ ] Litmaps Toggle Litmaps (What is Litmaps?) [ ] scite.ai Toggle scite Smart Citations (What are Smart Citations?) ( ) Code & Data Code and Data Associated with this Article [ ] arXiv Links to Code Toggle arXiv Links to Code & Data (What is Links to Code & Data?) ( ) Demos Demos [ ] Replicate Toggle Replicate (What is Replicate?) ( ) Related Papers Recommenders and Search Tools [ ] Connected Papers Toggle Connected Papers (What is Connected Papers?) [ ] Core recommender toggle CORE Recommender (What is CORE?) ( ) About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs and how to get involved. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?) * About * Help * Click here to contact arXiv Contact * Click here to subscribe Subscribe * Copyright * Privacy Policy * Web Accessibility Assistance * arXiv Operational Status Get status notifications via email or slack