Pages that link to "Item:Q1789204"
From MaRDI portal
The following pages link to Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 (Q1789204):
Displaying 7 items.
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
- New ways to multiply \(3 \times 3\)-matrices (Q2229749) (← links)
- Improved method for finding optimal formulas for bilinear maps in a finite field (Q2272384) (← links)
- A fast search algorithm for \(\langle m,m,m\rangle\) Triple Product Property triples and an application for \(5\times 5\) matrix multiplication (Q2344224) (← 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 approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\) (Q6082202) (← links)