ON THE BILINEAR COMPLEXITY OF THE MULTIPLICATION IN FINITE FIELDS
Stéphane Ballet, Robert Rolland · 2005
The aim of this paper is to introduce the bilinear complexity of the mul- tiplication in finite fields and to give a brief exposition of the recent results obtained in this part of algebraic complexity theory. In particular we present the new results obtained using the Chudnovsky-Chudnovsky algorithm and its generalizations. Resume (Sur la complexite bilineaire de la multiplication dans les corps finis)