Relative bilinear complexity and matrix multiplication.

Recommendations

On the approximate bilinear complexity of matrix multiplication
The bilinear complexity and practical algorithms for matrix multiplication
On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
On the complexity of some algorithms of matrix multiplication
scientific article; zbMATH DE number 151736
Lower bounds for the multiplicative complexity of matrix multiplication
On the complexity of integer matrix multiplication
Complexity of multiplication with vectors for structured matrices
On obtaining upper bounds on the complexity of matrix multiplication
The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\)

Cited in

(68)

A note on the gap between rank and border rank
Fast rectangular matrix multiplication and applications
Partial Degeneration of Tensors
Geometry and the complexity of matrix multiplication
Tensor rank: matching polynomials and Schur rings
scientific article; zbMATH DE number 7559388 (Why is no real title available?)
On bilinear algorithms over fields of different characteristics
On the order of approximation in approximative triadic decompositions of tensors
scientific article; zbMATH DE number 7689792 (Why is no real title available?)
The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity
Some computational problems in linear algebra as hard as matrix multiplication
Asymptotic tensor rank of graph tensors: beyond matrix multiplication
Rank and border rank of Kronecker powers of tensors and Strassen's laser method
Numerical stability and tensor nuclear norm
Tensors in computations
Bilinear mincing rank
Rectangular matrix multiplication revisited
Border Rank Nonadditivity for Higher Order Tensors
Ideals of varieties parameterized by certain symmetric tensors
Irreversibility of structure tensors of modules
Further limitations of the known approaches for matrix multiplication
Matrix structures in parallel matrix computations
Subrank and optimal reduction of scalar multiplications to generic tensors
scientific article; zbMATH DE number 7564426 (Why is no real title available?)
Generalizing Frobenius inversion to quaternion matrices
scientific article; zbMATH DE number 7561763 (Why is no real title available?)
Barriers for fast matrix multiplication from irreversibility
Universal points in the asymptotic spectrum of tensors
Asymptotic spectrum and matrix multiplication
Tensor surgery and tensor rank
A refined laser method and faster matrix multiplication
Fast structured matrix computations: tensor rank and Cohn-Umans method
Learning paths from signature tensors
A Gap in the Subrank of Tensors
Bounds on complexity of matrix multiplication away from Coppersmith-Winograd tensors
Unifying known lower bounds via geometric complexity theory
Abelian tensors
On the geometry of geometric rank
Geometric conditions for strict submultiplicativity of rank and border rank
Asymptotic entanglement transformation between W and GHZ states
Locating Eigenvalues of Symmetric Matrices - A Survey
Interactions of computational complexity theory and mathematics
Limits on the Universal method for matrix multiplication
On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
Grothendieck constant is norm of Strassen matrix multiplication tensor
On sunflowers and matrix multiplication
Beyond the Alder-Strassen bound.
Complexity and geometry of bilinear maps
Limits on the universal method for matrix multiplication
Geometric rank and linear determinantal varieties
Dimension of tensor network varieties
A Rank 18 Waring Decomposition of sM_〈3〉 with 432 Symmetries
The matrix capacity of a tensor
Towards a geometric approach to Strassen's asymptotic rank conjecture
The asymptotic induced matching number of hypergraphs: balanced binary strings
On the complexity of finding tensor ranks
The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\)
The Subrank of a Complex Symmetric Tensor Can Exceed its Symmetric Subrank
Tensor rank is not multiplicative under the tensor product
Border subrank via a generalised Hilbert-Mumford criterion
Weighted slice rank and a minimax correspondence to Strassen's spectra
On the complexity of the multiplication of matrices of small formats
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
New lower bounds for matrix multiplication and
Concise tensors of minimal border rank
Entanglement distillation from Greenberger-Horne-Zeilinger shares

This page was built for publication: Relative bilinear complexity and matrix multiplication.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757395)