Algebraic complexities and algebraic curves over finite fields

DOI10.1073/pnas.84.7.1739zbMath0644.68066OpenAlexW2023832849WikidataQ34607098 ScholiaQ34607098MaRDI QIDQ5903637

D. V. Chudnovsky, G. V. Choodnovsky

Publication date: 1987

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.84.7.1739

zbMATH Keywords

algebraic curves over finite fieldsalgebraic complexitymultiplicative complexityfast polynomial multiplicationlinear coding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Arithmetic theory of algebraic function fields (11R58) Finite ground fields in algebraic geometry (14G15) Algebraic functions and function fields in algebraic geometry (14H05) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (6)

Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Gaps between prime numbers and tensor rank of multiplication in finite fields ⋮ An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\) ⋮ A lower bound for the multiplication of polynomials modulo a polynomial ⋮ On the rank of certain finite fields ⋮ Efficient randomized generation of optimal algorithms for multiplication in certain finite fields

This page was built for publication: Algebraic complexities and algebraic curves over finite fields