Related Experiment Video
Updated: Aug 8, 2026

Generation and Coherent Control of Pulsed Quantum Frequency Combs
Published on: June 8, 2018
Algebraic complexities and algebraic curves over finite fields
D V Chudnovsky1, G V Chudnovsky
1Department of Mathematics, Columbia University, New York, NY 10027.
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.
Related Concept Videos
SFG Algebra
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Algebraic Expressions
Quadratic Equations in the Complex Number System
Introduction to Polynomial Functions
Fundamental Theorem of Algebra
Complex Zeros

