scientific article; zbMATH DE number 3514983
From MaRDI portal
Publication:4094392
Cited in
(16)- Rank and optimal computation of generic tensors
- On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
- More factors than subjects, tests and treatments: An indeterminacy theorem for canonical decomposition and individual differences scaling
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- The complexity of vector-products
- Some elementary proofs of lower bounds in complexity theory
- Global properties of tensor rank
- On the optimal computation of a set of symmetric and persymmetric bilinear forms
- On a signal processing algorithms based class of linear codes
- Structure of algebras of commutative matrices
- Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective
- Fast matrix multiplication and its algebraic neighbourhood
- Rank of 3-tensors with 2 slices and Kronecker canonical forms
- Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields
- On the maximal multiplicative complexity of a family of bilinear forms
- Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4094392)
