On the direct sum conjecture

DOI10.1016/0024-3795(84)90143-5zbMath0551.15013OpenAlexW2070616656WikidataQ122986836 ScholiaQ122986836MaRDI QIDQ801142

Ephraim Feig, Shmuel Winograd

Publication date: 1984

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(84)90143-5

zbMATH Keywords

complexitystructuredirect sum conjectureminimal algorithmssystems of bilinear forms

Mathematics Subject Classification ID

Quadratic and bilinear forms, inner products (15A63)

Related Items (9)

Multiplicative complexity of direct sums of quadratic systems ⋮ Abelian tensors ⋮ On the additive complexity of 2 \(\times 2\) matrix multiplication ⋮ The communication complexity of enumeration, elimination, and selection ⋮ On Strassen's Rank Additivity for Small Three-way Tensors ⋮ On the direct sum conjecture in the straight line model ⋮ Border Rank Nonadditivity for Higher Order Tensors ⋮ The Hitchhiker guide to: secant varieties and tensor decomposition ⋮ Progress on the symmetric Strassen conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Commutative algebras of minimal rank
• The multiplicative complexity of certain semilinear systems defined by polynomials
• On the algorithmic complexity of associative algebras
• Direct sums of bilinear algorithms
• On systems of bilinear forms whose minimal division-free algorithms are all bilinear
• Some bilinear forms whose multiplicative complexity depends on the field of constants
• Algebras Having Linear Multiplicative Complexities
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication

This page was built for publication: On the direct sum conjecture