Skip to main content
Proceedings of the National Academy of Sciences of the United States of America logoLink to Proceedings of the National Academy of Sciences of the United States of America
. 1987 Apr;84(7):1739–1743. doi: 10.1073/pnas.84.7.1739

Algebraic complexities and algebraic curves over finite fields

D V Chudnovsky 1, G V Chudnovsky 1
PMCID: PMC304516  PMID: 16593816

Abstract

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.

Keywords: polynomial multiplication, interpolation

Full text

PDF
1739

Articles from Proceedings of the National Academy of Sciences of the United States of America are provided here courtesy of National Academy of Sciences

RESOURCES