Conference paper
Algebraic constructions for algorithms
S. Winograd
SYMSAC 1981
In this paper we consider the system of bilinear forms which are defined by a product of two polynomials modulo a third P. We show that the number of multiplications depend on how the field of constants used in the algorithm splits P. If {Mathematical expression} then 2 ·deg (P) - k multiplications are needed. (We assume that Pi is irreducible.) © 1977 Springer-Verlag New York Inc.
S. Winograd
SYMSAC 1981
S. Winograd
SWCT 1962
S. Winograd
Mathematics of Computation
S. Winograd
Journal of the ACM