The following pages link to (Q5239688):
Displaying 9 items.
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
- Equivalent polyadic decompositions of matrix multiplication tensors (Q2074879) (← 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)
- Relative bilinear complexity and matrix multiplication. (Q3757395) (← links)
- On the Geometry of Border Rank Algorithms for <i><i>n</i> × 2</i> by <i>2 × 2</i> Matrix Multiplication (Q4976181) (← 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)
- A lower bound for bilinear complexity of matrix multiplication over a finite field (Q6545499) (← links)
