Direct sums of bilinear algorithms

DOI10.1016/0024-3795(81)90019-7MaRDI QIDQ1157377zbMATH OpenOpenAlexFDO

Authors Louis Auslander, Shmuel Winograd, 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

bilinear algorithmdirect summinimal algorithm

Mathematics Subject Classification ID

Quadratic and bilinear forms, inner products (15A63)

Cites work

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

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1157377)