Partial and Total Matrix Multiplication
From MaRDI portal
Publication:3912015
DOI10.1137/0210032zbMath0462.68018OpenAlexW2023724794MaRDI QIDQ3912015
Publication date: 1981
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0210032
Related Items
On bilinear algorithms over fields of different characteristics ⋮ The Faddeev-LeVerrier algorithm and the Pfaffian ⋮ A note on VNP-completeness and border complexity ⋮ Border rank of m\(\times n\times (mn-q)\) tensors ⋮ Halos and undecidability of tensor stable positive maps ⋮ On Comon's and Strassen's conjectures ⋮ Multiplicative complexity of direct sums of quadratic systems ⋮ The Subrank of a Complex Symmetric Tensor Can Exceed its Symmetric Subrank ⋮ Bounds on complexity of matrix multiplication away from Coppersmith-Winograd tensors ⋮ Fast commutative matrix algorithms ⋮ On the arithmetic complexity of Strassen-like matrix multiplications ⋮ Abelian tensors ⋮ Geometric conditions for strict submultiplicativity of rank and border rank ⋮ 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 ⋮ Geometry and the 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 ⋮ Asymptotic tensor rank of graph tensors: beyond matrix multiplication ⋮ Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity ⋮ Shortest-path problem is not harder than matrix multiplication ⋮ Tensor rank is not multiplicative under the tensor product ⋮ The matrix capacity of a tensor ⋮ On the algorithmic complexity of associative algebras ⋮ New combinations of methods for the acceleration of matrix multiplication ⋮ Fast structured matrix computations: tensor rank and Cohn-Umans method ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication ⋮ Unnamed Item ⋮ Matrix multiplication via arithmetic progressions ⋮ Reply to the paper The numerical instability of Bini's algorithm ⋮ HPMaX: heterogeneous parallel matrix multiplication using CPUs and GPUs ⋮ 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 third secant variety ⋮ On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices ⋮ On cap sets and the group-theoretic approach to matrix multiplication ⋮ A Rank 18 Waring Decomposition of sM〈3〉 with 432 Symmetries ⋮ Equations for Lower Bounds on Border Rank ⋮ Optimization techniques for small matrix multiplication ⋮ An adaptive procedure for the global minimization of a class of polynomial functions ⋮ Asymptotic entanglement transformation between W and GHZ states ⋮ Beyond the Alder-Strassen bound. ⋮ Unnamed Item ⋮ On Strassen's Rank Additivity for Small Three-way Tensors ⋮ On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication ⋮ Fast rectangular matrix multiplication and applications ⋮ Limits on the Universal method for matrix multiplication ⋮ Rank and border rank of Kronecker powers of tensors and Strassen's laser method ⋮ Fast parallel algorithms for polynomial division over an arbitrary field of constants ⋮ Border Rank Nonadditivity for Higher Order Tensors ⋮ Equivalent polyadic decompositions of matrix multiplication tensors ⋮ A note on border rank ⋮ Unnamed Item ⋮ Lower bounds in algebraic computational complexity ⋮ Progress on the symmetric Strassen conjecture ⋮ On commutativity and approximation ⋮ The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations ⋮ Unnamed Item ⋮ Typical tensorial rank ⋮ Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication ⋮ Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication ⋮ Improved lower bounds for some matrix multiplication problems ⋮ 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
