Classification of some minimal quadratic algorithms for computing the coefficients of the product of two polynomials over finite field

Abstract

In this paper we will classify all the minimal quadratic algorithms for computing one bilinear form and for computing the coefficients of ( Σi =0 n xi λi )( Σi =0 n yi λi ) where n ≤ q where q − 2 is the number of elements of the field.

Grigorive, Multiplicative complexity of a pair of bilinear forms and of polynomial multiplication

On the Number of Multiplications Necessary to Compute Certain Functions, Comm

S. Winograd

Pure and Appl. Math

1970

The complexity of schemes of function elements

A. L. Toom

Soviet Math. Dokl.,

1963

Similar Papers

Loading similar papers…

Cite this paper

@inproceedings{Bshouty2007ClassificationOS,
title={Classification of some minimal quadratic algorithms for computing the coefficients of the product of two polynomials over finite field},
author={Nader H. Bshouty and Michael Kaminski and Amir Averbuch},
year={2007}
}