Maximal bilinear complexity and codes

DOI10.1016/0024-3795(91)90060-AzbMath0717.68041OpenAlexW2015746530MaRDI QIDQ2638779

Joachim von zur Gathen

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0024-3795(91)90060-a

zbMATH Keywords

lower boundsalgebraic complexity theorybilinear complexitymaximal ranks of tensors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05)

Related Items

Multiplicative complexity of direct sums of quadratic systems, On Kruskal's theorem that every \(3{\times}3{\times}3\) array has rank at most 5, Maximal Rank of ${m}\times{n}\times 2$ Tensors over Arbitrary Fields, The parallel complexity of function approximation, Lower bounds for arithmetic networks, Almost all trees are co-immanantal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximal multiplicative complexity of a family of bilinear forms
• Rank and optimal computation of generic tensors
• Typical tensorial rank
• Lectures on the complexity of bilinear problems
• On two extremal matrix problems
• On the optimal evaluation of a set of bilinear forms
• Global properties of tensor rank
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Optimal Evaluation of Pairs of Bilinear Forms
• An Improved Lower Bound on Polynomial Multiplication
• Computations of Bilinear Forms over Finite Fields
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• A new approach to error-correcting codes