Pages that link to "Item:Q3759936"
From MaRDI portal
The following pages link to Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication (Q3759936):
Displaying 13 items.
- Optimization techniques for small matrix multiplication (Q533859) (← links)
- On the complexity of the multiplication of matrices of small formats (Q1394936) (← links)
- The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices (Q1739162) (← links)
- Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 (Q1789204) (← links)
- Equivalent polyadic decompositions of matrix multiplication tensors (Q2074879) (← links)
- New ways to multiply \(3 \times 3\)-matrices (Q2229749) (← links)
- On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication (Q2444860) (← links)
- Improving the Numerical Stability of Fast Matrix Multiplication (Q2827068) (← links)
- The bilinear complexity and practical algorithms for matrix multiplication (Q2940335) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation (Q6081940) (← links)
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication (Q6087745) (← links)
- A normal form for matrix multiplication schemes (Q6108729) (← links)