HackerPapers

arXiv:2210.04045cs.SC

The FBHHRBNRSSSHK-Algorithm for Multiplication in $\mathbb{Z}_2^{5\times5}$ is still not the end of the story

Manuel Kauers, Jakob Moosbauer

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
Journal reference
DOI
Subjects
cs.SCSymbolic Computation cs.CCComputational Complexity

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from May 2025 to May 2025. Found in 2 HN submissions from Oct 2022 to Oct 2022. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. AlphaEvolve: A Gemini-powered coding agent for designing advanced algorithms 1 comment

    • One of the researchers quoted in Nature link here... in the past, when DeepMind published "AlphaTensor" [1][2] in October 2022, it took a single day (!!), see [3], for improvements to the AlphaTensor-based scheme to be discovered. This was then a few months later generalized…

      friederrrView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.