Relative bilinear complexity and matrix multiplication.

DOI10.1515/CRLL.1987.375-376.406zbMATH Open0621.68026OpenAlexW1565043606MaRDI QIDQ3757395FDOQ3757395

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

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\)

zbMATH Keywords

matrix multiplication exponent bilinear complexity asymptotic spectrum of tensors deformation theory in modules over linear algebraic groups

Mathematics Subject Classification ID

Numerical linear algebra (65F99) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cited In (68)

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

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)