51 Additions per Recursive Step for Rank-23 3 times3 Matrix Multiplication, Machine-Checked over Arbitrary Rings
cs.MS, cs.CC, cs.DS, cs.SC
Submitted: 2026-10-17
Updated: 2026-10-17
Code: https://github.com/gsidebottom/logic
Terminology
Sources
- Automated Lower Bounds for Bilinear Complexity over Finite Fields
- A 60-Addition, Rank-23 Scheme for Exact 3x3 Matrix Multiplication
- A Rank 23 Algorithm for Multiplying 3 x 3 Matrices with an Arithmetic Complexity of 59
- A 58-Addition, Rank-23 Scheme for General 3x3 Matrix Multiplication
- An Exact 56-Addition, Rank-23 Scheme for General 3*3 Matrix Multiplication
- 55 Additions Suffice for 3x3 Matrix Multiplication at Rank 23
Related papers
- asdex: Automatic Sparse Differentiation in JAX
- Lord of the Precision, the Two Floats: Double-Word Arithmetic for Complex Numbers
- Streaming Right Multiplication over Grammar-Compressed Matrices: A Memory-Bounded GPU Engine for Genotype and Graph Data
- Improved Scaling for Fast Mode of Ozaki Scheme II
- BF16 Component-Product Emulation of FP32 and FP64 GEMM on Intel AMX
- QRecoupling.jl: numerical and exact computation of classical and quantum recoupling coefficients