scientific article; zbMATH DE number 7120972
From MaRDI portal
Publication:5239688
zbMath1441.68298MaRDI QIDQ5239688
Publication date: 22 October 2019
Full work available at URL: http://mathnet.ru/eng/cheb433
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Numerical linear algebra (65F99)
Related Items (3)
On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ Equivalent polyadic decompositions of matrix multiplication tensors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
- Matrix multiplication via arithmetic progressions
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
- On the complexity of the multiplication of matrices of small formats
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- The bilinear complexity and practical algorithms for matrix multiplication
- On the complexity of some algorithms of matrix multiplication
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
This page was built for publication:
