Certain systems of bilinear forms whose minimal algorithms are all quadratic

Auslander, 1980, The multiplicative complexity of certain semilinear systems defined by polynomials, Adv. in Appl. Math., 1, 257, 10.1016/0196-8858(80)90013-5 Feig, 1981, On systems of bilinear forms whose minimal division-free algorithms are all bilinear, J. Algor., 2, 261, 10.1016/0196-6774(81)90026-2 Fiduccia, 1975, Algebras Having Linear Multiplicative Complexities Winograd, 1980, Arithmetic Complexity of Computations Winograd, 1979, On multiplication in algebraic extension fields, Theoret. Comput. Sci., 8, 359, 10.1016/0304-3975(79)90017-3 Winograd, 1970, On the number of multiplications necessary to compute certain functions, Comm. Pure Appl. Math., 23, 165, 10.1002/cpa.3160230204 Winograd, 1977, Some bilinear forms whose multiplicative complexity depends on the field of constants, Math. Systems Theory, 10, 169, 10.1007/BF01683270 Winograd, 1979, On the multiplicative complexity of the Discrete Fourier Transform, Adv. in Math., 32, 83, 10.1016/0001-8708(79)90037-9