The algebraic complexity of computing a family of bilinear forms
From MaRDI portal
Publication:3910637
DOI10.1016/0041-5553(79)90124-1zbMath0461.15008OpenAlexW2071165158MaRDI QIDQ3910637
Publication date: 1980
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(79)90124-1
Analysis of algorithms and problem complexity (68Q25) Quadratic and bilinear forms, inner products (15A63) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)
This page was built for publication: The algebraic complexity of computing a family of bilinear forms