Lower bounds of the complexity of linear algebras
From MaRDI portal
Publication:1259163
DOI10.1016/0020-0190(79)90107-8zbMath0409.68020MaRDI QIDQ1259163
M. Capovani, Dario Andrea Bini
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(79)90107-8
Bilinear Forms; Algebraic Complexity; Multiplicative Complexity; Fiduccia- Zalcstein Conjecture; Residual Algorithm; Tensor Rank; Zero-Divisor Free Algebras
68Q25: Analysis of algorithms and problem complexity
15A63: Quadratic and bilinear forms, inner products
65F99: Numerical linear algebra
Related Items
Multiplicative complexity and algebraic structure, Two new algorithms for matrix multiplication and vector convolution
Cites Work