Adaptive flip graph algorithm for matrix multiplication
From MaRDI portal
Cites work
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- Discovering faster matrix multiplication algorithms with reinforcement learning
- Flip Graphs for Matrix Multiplication
- Gaussian elimination is not optimal
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- The bilinear complexity and practical algorithms for matrix multiplication
- The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89
This page was built for publication: Adaptive flip graph algorithm for matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033533)
