Maximal bilinear complexity and codes

DOI10.1016/0024-3795(91)90060-AMaRDI QIDQ2638779zbMATH OpenOpenAlexFDO

Authors 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

algebraic complexity theorybilinear complexitylower boundsmaximal ranks of tensors

Mathematics Subject Classification ID

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

Recommendations

• Optimal evaluation of pairs of bilinear forms
• scientific article; zbMATH DE number 606784
• A lower bound for the border rank of a bilinear map
• Lectures on the complexity of bilinear problems
• A new approach to error-correcting codes

Cites work

• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• A new approach to error-correcting codes
• An Improved Lower Bound on Polynomial Multiplication
• Computations of Bilinear Forms over Finite Fields
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Global properties of tensor rank
• scientific article; zbMATH DE number 3913670 (Why is no real title available?)
• scientific article; zbMATH DE number 4005610 (Why is no real title available?)
• scientific article; zbMATH DE number 53945 (Why is no real title available?)
• scientific article; zbMATH DE number 3461412 (Why is no real title available?)
• Lectures on the complexity of bilinear problems
• On the maximal multiplicative complexity of a family of bilinear forms
• On the optimal evaluation of a set of bilinear forms
• On two extremal matrix problems
• Optimal Evaluation of Pairs of Bilinear Forms
• Rank and optimal computation of generic tensors
• Typical tensorial rank

Cited in

(8)

• The parallel complexity of function approximation
• Multiplicative complexity of direct sums of quadratic systems
• Lower bounds for arithmetic networks
• On Kruskal's theorem that every \(3{\times}3{\times}3\) array has rank at most 5
• scientific article; zbMATH DE number 4057703 (Why is no real title available?)
• Maximal rank of m n 2 tensors over arbitrary fields
• Constructions of perfect bases for classes of 3-tensors
• Almost all trees are co-immanantal

This page was built for publication: Maximal bilinear complexity and codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638779)