Pages that link to "Item:Q1253097"

The following pages link to \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication (Q1253097):

Displayed 50 items.

• On the nuclear norm and the singular value decomposition of tensors (Q300892) ‎ (← links)
• Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations (Q330094) ‎ (← links)
• On the arithmetic complexity of Strassen-like matrix multiplications (Q346560) ‎ (← links)
• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) ‎ (← links)
• Symmetric tensor decomposition (Q603116) ‎ (← links)
• On the generic and typical ranks of 3-tensors (Q649550) ‎ (← links)
• A note on border rank (Q794161) ‎ (← links)
• On commutativity and approximation (Q799369) ‎ (← links)
• The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) ‎ (← links)
• On the approximate bilinear complexity of matrix multiplication (Q891131) ‎ (← links)
• Fast rectangular matrix multiplication and some applications (Q931517) ‎ (← links)
• Fast arithmetic for triangular sets: from theory to practice (Q1025397) ‎ (← links)
• Rank and optimal computation of generic tensors (Q1051066) ‎ (← links)
• Upper bounds on the complexity of solving systems of linear equations (Q1057647) ‎ (← links)
• Typical tensorial rank (Q1064383) ‎ (← links)
• Polynomial division and its computational complexity (Q1094135) ‎ (← links)
• A fast numerical algorithm for the composition of power series with complex coefficients (Q1095657) ‎ (← 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)
• On the order of approximation in approximative triadic decompositions of tensors (Q1123957) ‎ (← links)
• The numerical instability of Bini's algorithm (Q1148669) ‎ (← links)
• Complexity measures for matrix multiplication algorithms (Q1152202) ‎ (← links)
• Relations between exact and approximate bilinear algorithms. Applications (Q1152203) ‎ (← links)
• The bit-operation complexity of matrix multiplication and of all pair shortest path problem (Q1152952) ‎ (← links)
• On the algorithmic complexity of associative algebras (Q1154260) ‎ (← links)
• New combinations of methods for the acceleration of matrix multiplication (Q1154805) ‎ (← 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)
• Fast rectangular matrix multiplication and applications (Q1271174) ‎ (← links)
• On the complexity of the multiplication of matrices of small formats (Q1394936) ‎ (← links)
• Tensor decomposition and homotopy continuation (Q1679672) ‎ (← links)
• Beyond the Alder-Strassen bound. (Q1770421) ‎ (← links)
• The matrix capacity of a tensor (Q1947657) ‎ (← links)
• Equivalent polyadic decompositions of matrix multiplication tensors (Q2074879) ‎ (← links)
• On the relationship between \(p\)-dominance and stochastic stability in network games (Q2147856) ‎ (← links)
• Fast commutative matrix algorithms (Q2156374) ‎ (← links)
• On the closedness and geometry of tensor network state sets (Q2162500) ‎ (← 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)
• Fast hybrid matrix multiplication algorithms (Q2452754) ‎ (← links)
• Maximal bilinear complexity and codes (Q2638779) ‎ (← links)
• Learning algebraic models of quantum entanglement (Q2681640) ‎ (← links)
• The bilinear complexity and practical algorithms for matrix multiplication (Q2940335) ‎ (← links)
• Two new algorithms for matrix multiplication and vector convolution (Q3123351) ‎ (← links)
• Speedup of linear stationary iteration processes in multiprocessor computers. I (Q3334868) ‎ (← 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)