Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
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.
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Qing Li, Zhigang Deng, et al.
IEEE T-MI