Optimum computation of p bilinear forms

DOI10.1016/0024-3795(75)90071-3MaRDI QIDQ1218902zbMATH OpenOpenAlexFDO

Authors Jean-Claude Lafon

Publication date 1975

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

Full work available at URL https://doi.org/10.1016/0024-3795(75)90071-3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quadratic and bilinear forms, inner products (15A63)

Cites work

• Evaluation of rational functions
• Gaussian elimination is not optimal
• On multiplication of 2 2 matrices
• On obtaining upper bounds on the complexity of matrix multiplication

Cited in

(11)

• The complexity of vector-products
• On the optimal computation of a set of symmetric and persymmetric bilinear forms
• Global properties of tensor rank
• Ranks of tensors and a generalization of secant varieties
• Structure of algebras of commutative matrices
• The computational complexity of a set of quadratic functions
• On the maximal multiplicative complexity of a family of bilinear forms
• Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective
• Bounds on the ranks of some 3-tensors
• Algebraic and computational properties of a set of (0,1) matrices with prescribed sum
• Closure, commutativity and minimal complexity of some spaces of matrices

This page was built for publication: Optimum computation of p bilinear forms

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