On the order of approximation in approximative triadic decompositions of tensors

DOI10.1016/0304-3975(89)90141-2zbMath0678.15024OpenAlexW2076397052MaRDI QIDQ1123957

Thomas Lehmkuhl, Thomas Lickteig

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90141-2

zbMATH Keywords

upper boundalgebraic and topological border rank of tensorstriadic decomposition

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69)

Related Items (6)

A note on VNP-completeness and border complexity ⋮ Correction to: ``The complexity of factors of multivariate polynomials ⋮ A note on the gap between rank and border rank ⋮ Tensor rank is not multiplicative under the tensor product ⋮ The border rank of the multiplication of $2\times 2$ matrices is seven ⋮ Unnamed Item

Cites Work

• Definability and fast quantifier elimination in algebraically closed fields
• Lectures on the complexity of bilinear problems
• New combinations of methods for the acceleration of matrix multiplication
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Local reality on algebraic varieties
• Relative bilinear complexity and matrix multiplication.
• Partial and Total Matrix Multiplication
• An Extension of Strassen’s Degree Bound
• Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
• On the Asymptotic Complexity of Matrix Multiplication
• Singular Points of Complex Hypersurfaces. (AM-61)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the order of approximation in approximative triadic decompositions of tensors