Pages that link to "Item:Q2548859"

The following pages link to On multiplication of 2 \(\times\) 2 matrices (Q2548859):

Displaying 18 items.

• Error‐free transformation of matrix multiplication with a posteriori validation (Q2955990) (← links)
• Tripartite Entanglement Transformations and Tensor Rank (Q3107626) (← links)
• The border rank of the multiplication of $2\times 2$ matrices is seven (Q3376942) (← links)
• Geometry and the complexity of matrix multiplication (Q3498865) (← links)
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications (Q4085178) (← links)
• Some bilinear forms whose multiplicative complexity depends on the field of constants (Q4138004) (← links)
• The border support rank of two-by-two matrix multiplication is seven (Q4615808) (← links)
• Numerical tensor calculus (Q4683918) (← 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)
• Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\) (Q5941297) (← links)
• Numerical stability and tensor nuclear norm (Q6153359) (← links)
• A lower bound for bilinear complexity of matrix multiplication over a finite field (Q6545499) (← links)
• Classifying entanglement by algebraic geometry (Q6580209) (← links)
• Generic polynomial algorithms for the knapsack problem in some matrix semigroups (Q6587364) (← links)
• Notions of tensor rank (Q6597977) (← links)
• The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89 (Q6666556) (← links)