scientific article; zbMATH DE number 7559388

DOI10.4230/LIPIcs.MFCS.2020.17MaRDI QIDQ5089178

Markus Bläser, Vladimir Lysikov

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tensorsbarriersmatrix multiplicationGIT stabilityslice rank

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Concise tensors of minimal border rank ⋮ Irreversibility of structure tensors of modules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Convexity properties of the moment mapping. III
• Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem
• Gaussian elimination is not optimal
• Improved bound for complexity of matrix multiplication
• Fast Matrix Multiplication
• Entanglement Polytopes: Multiparticle Entanglement from Single-Particle Information
• Powers of tensors and fast matrix multiplication
• Relative bilinear complexity and matrix multiplication.
• Partial and Total Matrix Multiplication
• On the Asymptotic Complexity of Matrix Multiplication
• Geometric Invariant Theory
• On degeneration of tensors and algebras
• On cap sets and the group-theoretic approach to matrix multiplication
• Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory
• Further Limitations of the Known Approaches for Matrix Multiplication
• Limits on the Universal method for matrix multiplication
• Universal points in the asymptotic spectrum of tensors
• Multiplying matrices faster than coppersmith-winograd

This page was built for publication: