Pages that link to "Item:Q483185"

The following pages link to On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185):

Displayed 11 items.

• On the approximate bilinear complexity of matrix multiplication (Q891131) ‎ (← links)
• Tensor decomposition and homotopy continuation (Q1679672) ‎ (← links)
• Tensor rank is not multiplicative under the tensor product (Q1698592) ‎ (← links)
• Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 (Q1789204) ‎ (← 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)
• The bilinear complexity and practical algorithms for matrix multiplication (Q2940335) ‎ (← links)
• On the Geometry of Border Rank Algorithms for <i><i>n</i> × 2</i> by <i>2 × 2</i> Matrix Multiplication (Q4976181) ‎ (← 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)