Pages that link to "Item:Q1152203"

The following pages link to Relations between exact and approximate bilinear algorithms. Applications (Q1152203):

Displaying 39 items.

• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
• The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
• Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
• Rank and optimal computation of generic tensors (Q1051066) (← links)
• Tensor and border rank of certain classes of matrices and the fast evaluation of determinant, inverse matrix, and eigenvalues (Q1085947) (← links)
• A lower bound for the border rank of a bilinear map (Q1088760) (← links)
• The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670) (← links)
• Matrix structures in parallel matrix computations (Q1122309) (← links)
• Complexity measures for matrix multiplication algorithms (Q1152202) (← links)
• Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication (Q1158927) (← links)
• Reply to the paper ''The numerical instability of Bini's algorithm'' (Q1162356) (← links)
• Fast matrix multiplication without APA-algorithms (Q1168050) (← links)
• On the asymptotic complexity of rectangular matrix multiplication (Q1173402) (← links)
• Tensor rank is not multiplicative under the tensor product (Q1698592) (← links)
• The matrix capacity of a tensor (Q1947657) (← links)
• Rank and border rank of Kronecker powers of tensors and Strassen's laser method (Q2062866) (← links)
• A note on VNP-completeness and border complexity (Q2122788) (← links)
• Fast commutative matrix algorithms (Q2156374) (← links)
• The \(G\)-stable rank for tensors and the cap set problem (Q2166199) (← links)
• An introduction to the computational complexity of matrix multiplication (Q2176822) (← links)
• Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
• A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices (Q2354472) (← links)
• Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
• On the structure tensor of \(\mathfrak{sl}_n\) (Q2676747) (← links)
• The bilinear complexity and practical algorithms for matrix multiplication (Q2940335) (← links)
• Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
• Fast parallel algorithms for polynomial division over an arbitrary field of constants (Q4723298) (← links)
• Border Rank Nonadditivity for Higher Order Tensors (Q4986826) (← links)
• (Q5092471) (← links)
• On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry (Q5347291) (← links)
• Border Rank Is Not Multiplicative under the Tensor Product (Q5382574) (← links)
• A new approach for computing the inverse of confluent Vandermonde matrices via Taylor's expansion (Q5870136) (← links)
• Tensors in computations (Q5887832) (← links)
• Fast inversion of triangular Toeplitz matrices (Q5893874) (← links)
• (Q6041403) (← links)
• The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\) (Q6082202) (← links)
• Partial Degeneration of Tensors (Q6130652) (← links)
• New lower bounds for matrix multiplication and (Q6161101) (← links)
• On the closures of monotone algebraic classes and variants of the determinant (Q6582370) (← links)