Optimal evaluation of pairs of bilinear forms
From MaRDI portal
Publication:5402555
DOI10.1145/800133.804345zbMath1282.68115OpenAlexW2061547567MaRDI QIDQ5402555
Publication date: 14 March 2014
Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/800133.804345
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (9)
Ranks of tensors and a generalization of secant varieties ⋮ Bounds on the ranks of some 3-tensors ⋮ The tensor rank of tensor product of two three-qubit W states is eight ⋮ Relation between rank and multiplicative complexity of a bilinear form over a commutative Noetherian ring ⋮ Optimal Karatsuba-like formulae for certain bilinear forms in GF(2) ⋮ Rank and optimal computation of generic tensors ⋮ Lower bounds in algebraic computational complexity ⋮ Pencils of complex and real symmetric and skew matrices ⋮ Typical tensorial rank
This page was built for publication: Optimal evaluation of pairs of bilinear forms
