On the Complexity of Bilinear Forms with Commutativity

DOI10.1137/0209056zbMath0451.68035OpenAlexW2020089563MaRDI QIDQ3898027

Joseph F. Ja'Ja'

Publication date: 1980

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0209056

zbMATH Keywords

bilinear formsalgebraic complexitytensor rankmatrix multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Vector and tensor algebra, theory of invariants (15A72) Quadratic and bilinear forms, inner products (15A63)

Related Items

Multiplicative complexity of direct sums of quadratic systems, The computational complexity of a set of quadratic functions, The multiplicative complexity of quadratic boolean forms, On commutativity and approximation