4 papers
Fast Matrix Multiplication in Small Formats: Discovering New Schemes with an Open-Source Flip Graph Framework
A. I. Perminov
An open-source C++ framework for discovering fast matrix multiplication schemes using the flip graph approach is presented. The framework supports multiple coefficient rings -- bin…
A 58-Addition, Rank-23 Scheme for General 3x3 Matrix Multiplication
A. I. Perminov
This paper presents a new state-of-the-art algorithm for exact matrix multiplication over general non-commutative rings, achieving a rank-23 scheme with only 58 scalar a…
Parallel Heuristic Exploration for Additive Complexity Reduction in Fast Matrix Multiplication
A. I. Perminov
This paper presents a parallel random-search method for reducing additive complexity in fast matrix multiplication algorithms with ternary coefficients . The approach r…
Fast Matrix Multiplication via Ternary Meta Flip Graphs
A. I. Perminov
Matrix multiplication optimization remains a fundamental challenge in computational mathematics. This work introduces a novel approach that discovers matrix multiplication schemes…