Relative bilinear complexity and matrix multiplication.
From MaRDI portal
Publication:3757395
DOI10.1515/crll.1987.375-376.406zbMath0621.68026OpenAlexW1565043606MaRDI QIDQ3757395
Publication date: 1987
Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)
Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002204460
exponentmatrix multiplicationbilinear complexityasymptotic spectrum of tensorsdeformation theory in modules over linear algebraic groups
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Numerical linear algebra (65F99)
Related Items
On bilinear algorithms over fields of different characteristics ⋮ Universal points in the asymptotic spectrum of tensors ⋮ Tensors in computations ⋮ The Subrank of a Complex Symmetric Tensor Can Exceed its Symmetric Subrank ⋮ Bounds on complexity of matrix multiplication away from Coppersmith-Winograd tensors ⋮ Rectangular matrix multiplication revisited ⋮ A note on the gap between rank and border rank ⋮ On sunflowers and matrix multiplication ⋮ Abelian tensors ⋮ Bilinear mincing rank ⋮ On the geometry of geometric rank ⋮ Matrix structures in parallel matrix computations ⋮ Geometric conditions for strict submultiplicativity of rank and border rank ⋮ On the order of approximation in approximative triadic decompositions of tensors ⋮ On the complexity of finding tensor ranks ⋮ Geometry and the complexity of matrix multiplication ⋮ On the complexity of the multiplication of matrices of small formats ⋮ A Gap in the Subrank of Tensors ⋮ Tensor rank: matching polynomials and Schur rings ⋮ Dimension of tensor network varieties ⋮ Tensor surgery and tensor rank ⋮ Asymptotic tensor rank of graph tensors: beyond matrix multiplication ⋮ Concise tensors of minimal border rank ⋮ Partial Degeneration of Tensors ⋮ Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity ⋮ Numerical stability and tensor nuclear norm ⋮ New lower bounds for matrix multiplication and ⋮ Tensor rank is not multiplicative under the tensor product ⋮ Locating Eigenvalues of Symmetric Matrices - A Survey ⋮ Interactions of computational complexity theory and mathematics ⋮ Weighted slice rank and a minimax correspondence to Strassen's spectra ⋮ The matrix capacity of a tensor ⋮ Fast structured matrix computations: tensor rank and Cohn-Umans method ⋮ Geometric rank and linear determinantal varieties ⋮ Unnamed Item ⋮ Further Limitations of the Known Approaches for Matrix Multiplication ⋮ Learning Paths from Signature Tensors ⋮ Towards a geometric approach to Strassen's asymptotic rank conjecture ⋮ Some computational problems in linear algebra as hard as matrix multiplication ⋮ A Rank 18 Waring Decomposition of sM〈3〉 with 432 Symmetries ⋮ Entanglement distillation from Greenberger-Horne-Zeilinger shares ⋮ Ideals of varieties parameterized by certain symmetric tensors ⋮ Asymptotic entanglement transformation between W and GHZ states ⋮ Beyond the Alder-Strassen bound. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 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 ⋮ Barriers for fast matrix multiplication from irreversibility ⋮ Border Rank Nonadditivity for Higher Order Tensors ⋮ The asymptotic induced matching number of hypergraphs: balanced binary strings ⋮ Grothendieck constant is norm of Strassen matrix multiplication tensor ⋮ Unnamed Item ⋮ Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication ⋮ Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication ⋮ Unifying known lower bounds via geometric complexity theory
