$\mathbb{Z}_2^{5\times5}$中的FBHHRBNRSSSHK乘法算法仍然不是故事的结尾
The FBHHRBNRSSSHK-Algorithm for Multiplication in $\mathbb{Z}_2^{5\times5}$ is still not the end of the story
摘要：
为了响应最近的自然文章，宣布了一个算法乘以$5\times5$-矩阵在$\mathbb{Z}_2$只有96次乘法，比以前的记录少两个，我们提出了一个算法，做这项工作只有95次乘法。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
