About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Certain systems of bilinear forms whose minimal algorithms are all quadratic
Abstract
In this paper we prove that every minimal algorithm for computing a bilinear form is quadratic. It is then easy to show that for certain systems of bilinear forms all minimal algorithms are quadratic. One such system is for computing the product of two arbitrary elements in a finite algebraic extension field. This result, together with the results of the author in (E. Feig, to appear) and those of Winograd (Theoret. Comput. Sci.8 (1979), 359-377), completely characterize all minimal algorithms for computing products in these fields. © 1983.