Lower bounds of the complexity of linear algebras

DOI10.1016/0020-0190(79)90107-8zbMath0409.68020OpenAlexW2036897928MaRDI 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

zbMATH Keywords

Bilinear FormsAlgebraic ComplexityMultiplicative ComplexityFiduccia- Zalcstein ConjectureResidual AlgorithmTensor RankZero-Divisor Free Algebras

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quadratic and bilinear forms, inner products (15A63) Numerical linear algebra (65F99)

Related Items (2)

Two new algorithms for matrix multiplication and vector convolution ⋮ Multiplicative complexity and algebraic structure

Cites Work

• Unnamed Item
• Some elementary proofs of lower bounds in complexity theory
• Algebras Having Linear Multiplicative Complexities

This page was built for publication: Lower bounds of the complexity of linear algebras