On the optimal evaluation of a set of bilinear forms
From MaRDI portal
Publication:1245572
DOI10.1016/0024-3795(78)90012-5zbMath0376.68042OpenAlexW2010537260MaRDI QIDQ1245572
David P. Dobkin, Roger W. Brockett
Publication date: 1978
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(78)90012-5
Related Items
The tensor rank of semifields of order 16 and 81, Border rank of m\(\times n\times (mn-q)\) tensors, The quadratic hull of a code and the geometric view on multiplication algorithms, Tensor and border rank of certain classes of matrices and the fast evaluation of determinant, inverse matrix, and eigenvalues, A lower bound for the border rank of a bilinear map, Multiplicative complexity of direct sums of quadratic systems, Maximal bilinear complexity and codes, Complexities of special matrix multiplication problems, Maximal Rank of ${m}\times{n}\times 2$ Tensors over Arbitrary Fields, Fast matrix multiplication is stable, Geometry and the complexity of matrix multiplication, Stability of fast algorithms for matrix multiplication, Bounds on the ranks of some 3-tensors, On the complexity of the multiplication of matrices of small formats, On the complexity of computing bilinear forms with \(\{0,1\}\) constants, Constructions of perfect bases for classes of 3-tensors, On the algorithmic complexity of associative algebras, Direct sums of bilinear algorithms, Fast matrix multiplication and its algebraic neighbourhood, The computational complexity of a set of quadratic functions, Computing lower bounds on tensor rank over finite fields, Fast matrix multiplication without APA-algorithms, Gaps between prime numbers and tensor rank of multiplication in finite fields, Trade-offs between communication and space, Algebraic complexities and algebraic curves over finite fields, Beyond the Alder-Strassen bound., Improved method for finding optimal formulas for bilinear maps in a finite field, Rank of 3-tensors with 2 slices and Kronecker canonical forms, Tensor Representation of Rank-Metric Codes, Closure, commutativity and minimal complexity of some spaces of matrices, Equivalent polyadic decompositions of matrix multiplication tensors, On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry, Algebraic and computational properties of a set of (0,1) matrices with prescribed sum, Improved lower bounds for some matrix multiplication problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Commutativity, non-commutativity, and bilinearity
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- On multiplication of 2 \(\times\) 2 matrices
- Sur le calcul des produits de matrices. (Calculation of the product of matrices.)
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
- On the Number of Multiplications Required for Matrix Multiplication
- Universality of iterated networks
- On the number of multiplications necessary to compute certain functions
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
