Abstract
In this paper we consider the system of bilinear forms which are defined by a product of two polynomials modulo a thirdP. We show that the number of multiplications depend on how the field of constants used in the algorithm splitsP. If\(P = \prod\nolimits_{i = 1}^k {P_i^{li} } \) then 2 ·deg(P) − k multiplications are needed. (We assume thatP i is irreducible.)
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Pan, V. Ya., Methods of computing values of polynomials,Russian Mathematical Surveys,21 (1966) 105–136.
Winograd, S., On the number of multiplications necessary to compute certain functions,Comm. Pure and Appl. Math.,23 (1970) 165–179.
Fiduccia, C. M. andY. Zalcstein,Algebras having linear multiplicative complexities, Technical Report46, Department of Computer Science, State University of New York at Stony Brook, (August 1975).
Winograd, S., On multiplication of 2 × 2 matrices,Linear Alg. Appl.,4 (1971) 381–388.
Strassen, V., Vermeidung von Divisionen,J. für reine und angewandte Mathematik,264 (1973), 184–202.
Toom, A. L., The Complexity of a Scheme of Functional Elements, Soviet Mathematics, Translations of Doklady Akademie,Nauk. S.S.S.R.,4, (June 1963), 714–717.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Winograd, S. Some bilinear forms whose multiplicative complexity depends on the field of constants. Math. Systems Theory 10, 169–180 (1976). https://doi.org/10.1007/BF01683270
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01683270