\(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
From MaRDI portal
Publication:1253097
DOI10.1016/0020-0190(79)90113-3zbMath0395.68048OpenAlexW1996440503MaRDI QIDQ1253097
Grazia Lotti, M. Capovani, Francesco Romani, Dario Andrea Bini
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(79)90113-3
Related Items
Tensors in computations, On the nuclear norm and the singular value decomposition of tensors, Polynomial division and its computational complexity, A fast numerical algorithm for the composition of power series with complex coefficients, On the relationship between \(p\)-dominance and stochastic stability in network games, Maximal bilinear complexity and codes, Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations, Fast commutative matrix algorithms, On the arithmetic complexity of Strassen-like matrix multiplications, On the closedness and geometry of tensor network state sets, The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms, Matrix structures in parallel matrix computations, Symmetric tensor decomposition, On the order of approximation in approximative triadic decompositions of tensors, An introduction to the computational complexity of matrix multiplication, The bilinear complexity and practical algorithms for matrix multiplication, Tensor decomposition and homotopy continuation, Geometry and the complexity of matrix multiplication, On the approximate bilinear complexity of matrix multiplication, Skew-polynomial-sparse matrix multiplication, On the complexity of the multiplication of matrices of small formats, Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation, The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\), Learning algebraic models of quantum entanglement, Partial Degeneration of Tensors, On the closures of monotone algebraic classes and variants of the determinant, The numerical instability of Bini's algorithm, Complexity measures for matrix multiplication algorithms, Relations between exact and approximate bilinear algorithms. Applications, The bit-operation complexity of matrix multiplication and of all pair shortest path problem, The matrix capacity of a tensor, On the algorithmic complexity of associative algebras, New combinations of methods for the acceleration of matrix multiplication, Fast matrix multiplication and its algebraic neighbourhood, Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication, Reply to the paper The numerical instability of Bini's algorithm, On the generic and typical ranks of 3-tensors, Fast matrix multiplication without APA-algorithms, On the asymptotic complexity of rectangular matrix multiplication, Further Limitations of the Known Approaches for Matrix Multiplication, Fast hybrid matrix multiplication algorithms, Fast rectangular matrix multiplication and some applications, On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices, A Rank 18 Waring Decomposition of sM〈3〉 with 432 Symmetries, Speedup of linear stationary iteration processes in multiprocessor computers. I, Beyond the Alder-Strassen bound., Unnamed Item, Unnamed Item, The border rank of the multiplication of $2\times 2$ matrices is seven, On best rank-2 and rank-(2,2,2) approximations of order-3 tensors, On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication, Fast rectangular matrix multiplication and applications, Fast arithmetic for triangular sets: from theory to practice, Equivalent polyadic decompositions of matrix multiplication tensors, Rank and optimal computation of generic tensors, Two new algorithms for matrix multiplication and vector convolution, A note on border rank, Upper bounds on the complexity of solving systems of linear equations, On commutativity and approximation, The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations, Typical tensorial rank, Unifying known lower bounds via geometric complexity theory, A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
Cites Work
