Optimum computation of p bilinear forms
From MaRDI portal
Publication:1218902
DOI10.1016/0024-3795(75)90071-3zbMath0309.15015OpenAlexW2049715266MaRDI QIDQ1218902
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
Analysis of algorithms and problem complexity (68Q25) Quadratic and bilinear forms, inner products (15A63)
Related Items
Structure of algebras of commutative matrices, Ranks of tensors and a generalization of secant varieties, Bounds on the ranks of some 3-tensors, The computational complexity of a set of quadratic functions, Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective, The complexity of vector-products, Global properties of tensor rank, On the optimal computation of a set of symmetric and persymmetric bilinear forms, On the maximal multiplicative complexity of a family of bilinear forms, Closure, commutativity and minimal complexity of some spaces of matrices, Algebraic and computational properties of a set of (0,1) matrices with prescribed sum
Cites Work
