Pages that link to "Item:Q3698315"
From MaRDI portal
The following pages link to On the complexity of some algorithms of matrix multiplication (Q3698315):
Displaying 12 items.
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
- Semisimple algebras of almost minimal rank over the reals (Q1034526) (← links)
- Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 (Q1789204) (← links)
- An introduction to the computational complexity of matrix multiplication (Q2176822) (← links)
- On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field (Q2191009) (← links)
- A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices (Q2354472) (← links)
- On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication (Q2444860) (← links)
- The bilinear complexity and practical algorithms for matrix multiplication (Q2940335) (← links)
- Geometry and the complexity of matrix multiplication (Q3498865) (← links)
- (Q5239688) (← links)
- An adaptive prefix-assignment technique for symmetry reduction (Q5919303) (← links)
- The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\) (Q6082202) (← links)