scientific article

zbMath0805.14028MaRDI QIDQ4027646

Michael A. Tsfasman, S. G. Vleduts, Igor E. Shparlinski

Publication date: 21 February 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Shimura curvescodesmultiplicative complexitysupercodesbilinear multiplication algorithmcurves over finite fields with many points

Mathematics Subject Classification ID

Arithmetic ground fields for curves (14H25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Curves over finite and local fields (11G20) Finite ground fields in algebraic geometry (14G15) Computational aspects of algebraic curves (14Q05)

Related Items (30)

An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields ⋮ A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line ⋮ The quadratic hull of a code and the geometric view on multiplication algorithms ⋮ An improvement of bilinear complexity bounds in some finite fields. ⋮ Complexity of computation in finite fields ⋮ On some bounds for symmetric tensor rank of multiplication in finite fields ⋮ Tower of algebraic function fields with maximal Hasse-Witt invariant and tensor rank of multiplication in any extension of \(\mathbb{F}_2\) and \(\mathbb{F}_3\) ⋮ Chaining multiplications in finite fields with Chudnovsky-type algorithms and tensor rank of the \(k\)-multiplication ⋮ 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\) ⋮ The equivariant complexity of multiplication in finite field extensions ⋮ Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method ⋮ Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of \(\mathbb F_q\) ⋮ Unnamed Item ⋮ Multiplication algorithm in a finite field and tensor rank of the multiplication. ⋮ On the tensor rank of the multiplication in the finite fields ⋮ Dense families of modular curves, prime numbers and uniform symmetric tensor rank of multiplication in certain finite fields ⋮ Gaps between prime numbers and tensor rank of multiplication in finite fields ⋮ Trisymmetric multiplication formulae in finite fields ⋮ Faster Polynomial Multiplication via Discrete Fourier Transforms ⋮ Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication ⋮ On multiplication in finite fields ⋮ On the bounds of the bilinear complexity of multiplication in some finite fields ⋮ Multiplication of polynomials modulo \(x^n\) ⋮ On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation ⋮ On the bilinear complexity of the multiplication in small finite fields ⋮ Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\) ⋮ 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 ⋮ Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields

This page was built for publication: