The FBHHRBNRSSSHK-Algorithm for Multiplication in ℤ_2^5×5 is still not the end of the story

10/08/2022

∙

In response to a recent Nature article which announced an algorithm for multiplying 5×5-matrices over ℤ_2 with only 96 multiplications, two fewer than the previous record, we present an algorithm that does the job with only 95 multiplications.

READ FULL TEXT

The FBHHRBNRSSSHK-Algorithm for Multiplication in ℤ_2^5×5 is still not the end of the story

Non-existence of a short algorithm for multiplication of 3×3 matrices with group S_4× S_3

New ways to multiply 3 x 3-matrices

On automorphism group of a possible short algorithm for multiplication of 3×3 matrices

The tensor rank of 5x5 matrices multiplication is bounded by 98 and its border rank by 89

Non-existence of a short algorithm for multiplication of 3×3 matrices with group S_4× S_3, II

Fabchain: Managing Audit-able 3D Print Job over Blockchain

The FBHHRBNRSSSHK-Algorithm for Multiplication in ℤ_2^5×5 is still not the end of the story

Related Research

Non-existence of a short algorithm for multiplication of 3×3 matrices with group S_4× S_3

New ways to multiply 3 x 3-matrices

On automorphism group of a possible short algorithm for multiplication of 3×3 matrices

The tensor rank of 5x5 matrices multiplication is bounded by 98 and its border rank by 89

Non-existence of a short algorithm for multiplication of 3×3 matrices with group S_4× S_3, II

Fabchain: Managing Audit-able 3D Print Job over Blockchain