S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
In this paper we study the bilinear complexity of multiplying two arbitrary elements from an nth degree extension Φ of a finite field F, and the related problem of multiplying, over F, two polynomials of degree n - 1 with indeterminate coefficients. We derive a new linear lower bound, and we describe an algorithm leading to a quasi-linear upper bound. © 1983.
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007