Direct sums of bilinear algorithms

DOI10.1016/0024-3795(81)90019-7zbMath0471.15009OpenAlexW1963546854MaRDI QIDQ1157377

Shmuel Winograd, Louis Auslander, Ephraim Feig

Publication date: 1981

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(81)90019-7

zbMATH Keywords

direct summinimal algorithmbilinear algorithm

Mathematics Subject Classification ID

Quadratic and bilinear forms, inner products (15A63)

Related Items (2)

Multiplicative complexity of direct sums of quadratic systems ⋮ On the direct sum conjecture

Cites Work

• On the optimal evaluation of a set of bilinear forms
• On the multiplicative complexity of the discrete Fourier transform
• The Computational Complexity of Continued Fractions
• Some bilinear forms whose multiplicative complexity depends on the field of constants
• On the number of multiplications necessary to compute certain functions

This page was built for publication: Direct sums of bilinear algorithms