Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of \(\mathbb F_q\)
From MaRDI portal
Publication:1414023
DOI10.1016/S1071-5797(03)00026-1zbMath1101.11048OpenAlexW2041324037MaRDI QIDQ1414023
Publication date: 19 November 2003
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1071-5797(03)00026-1
Arithmetic theory of algebraic function fields (11R58) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20)
Related Items (13)
On the existence of non-special divisors of degree \(g\) and \(g-1\) in algebraic function fields over \(\mathbb{F}_2\) ⋮ An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields ⋮ An improvement of bilinear complexity bounds in some finite fields. ⋮ A graph aided strategy to produce good recursive towers over finite fields ⋮ On some bounds for symmetric tensor rank of multiplication in finite fields ⋮ Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity ⋮ On the tensor rank of multiplication in any extension of \(\mathbb F_2\) ⋮ Multiplication algorithm in a finite field and tensor rank of the multiplication. ⋮ On the tensor rank of the multiplication in the finite fields ⋮ Gaps between prime numbers and tensor rank of multiplication in finite fields ⋮ On the bounds of the bilinear complexity of multiplication in some finite fields ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry ⋮ New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields
Cites Work
This page was built for publication: Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of \(\mathbb F_q\)
