Algebraic complexities and algebraic curves over finite fields.
We consider the problem of minimal (multiplicative) complexity of polynomial multiplication and multiplication in finite extensions of fields. For infinite fields minimal complexities are known [Winograd, S. (1977) Math. Syst. Theory 10, 169-180]. We prove lower and upper bounds on minimal complexities over finite fields, both linear in the number of inputs, using the relationship with linear coding theory and algebraic curves over finite fields.
Department of Mathematics, Columbia University, New York, NY 10027.
D V
DV
Chudnovsky
G V
GV
Chudnovsky