On the maximal multiplicative complexity of a family of bilinear forms

DOI10.1016/0024-3795(79)90026-0zbMath0416.68039OpenAlexW1990388068MaRDI QIDQ754639

D. Kharzeev

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0024-3795(79)90026-0

zbMATH Keywords

bilinear formalgebraic computational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General binary quadratic forms (11E16)

Related Items (20)

Border rank of m\(\times n\times (mn-q)\) tensors ⋮ Maximal rank of an element of a tensor product ⋮ Multiplicative complexity of direct sums of quadratic systems ⋮ About the maximal rank of 3-tensors over the real and the complex number field ⋮ On the rank of 3×3×3-tensors ⋮ Approximation by matrices with simple spectra ⋮ Maximal bilinear complexity and codes ⋮ Maximal Rank of ${m}\times{n}\times 2$ Tensors over Arbitrary Fields ⋮ Bounds on the ranks of some 3-tensors ⋮ Constructions of perfect bases for classes of 3-tensors ⋮ Tensor decompositions and rank increment conjecture ⋮ Unnamed Item ⋮ The typical rank of tall three-way arrays ⋮ On maximum, typical and generic ranks ⋮ On Strassen's Rank Additivity for Small Three-way Tensors ⋮ On the maximal multiplicative complexity of a family of bilinear forms ⋮ Rank and optimal computation of generic tensors ⋮ Ranks of tensors, secant varieties of Segre varieties and fat points ⋮ On the maximum rank of a tensor product ⋮ Typical tensorial rank

Cites Work

• Unnamed Item
• Unnamed Item
• On the maximal multiplicative complexity of a family of bilinear forms
• Optimum computation of p bilinear forms
• Algebras Having Linear Multiplicative Complexities

This page was built for publication: On the maximal multiplicative complexity of a family of bilinear forms