Pages that link to "Item:Q2940335"

The following pages link to The bilinear complexity and practical algorithms for matrix multiplication (Q2940335):

Displaying 32 items.

• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
• On the approximate bilinear complexity of matrix multiplication (Q891131) (← links)
• The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670) (← links)
• Tensor decomposition and homotopy continuation (Q1679672) (← links)
• The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices (Q1739162) (← links)
• Equivalent polyadic decompositions of matrix multiplication tensors (Q2074879) (← links)
• Fast commutative matrix algorithms (Q2156374) (← links)
• An introduction to the computational complexity of matrix multiplication (Q2176822) (← links)
• On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field (Q2191009) (← links)
• Symmetric matrices whose entries are linear functions (Q2206413) (← 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 bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices (Q2354472) (← links)
• Tensor surgery and tensor rank (Q2422765) (← links)
• Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
• Improving the numerical stability of fast matrix multiplication (Q2827068) (← links)
• Relative bilinear complexity and matrix multiplication. (Q3757395) (← links)
• Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
• On the Geometry of Border Rank Algorithms for <i><i>n</i> × 2</i> by <i>2 × 2</i> Matrix Multiplication (Q4976181) (← links)
• Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition (Q5009907) (← links)
• (Q5239688) (← links)
• On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry (Q5347291) (← links)
• (Q5875595) (← links)
• An adaptive prefix-assignment technique for symmetry reduction (Q5919303) (← links)
• Оценивание множеств решений линейных систем обыкновенных дифференциальных уравнений с возмущениями на основе оператора Коши;The estimation of sol (Q6056012) (← links)
• The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\) (Q6082202) (← links)
• Pebbling Game and Alternative Basis for High Performance Matrix Multiplication (Q6087745) (← links)
• Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity (Q6142335) (← links)
• New lower bounds for matrix multiplication and (Q6161101) (← links)
• Finding complex-valued solutions of brent equations using nonlinear least squares (Q6636622) (← links)
• Semi-analytical solution of Brent equations (Q6644122) (← links)
• The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89 (Q6666556) (← links)