scientific article
zbMATH Open0805.14028MaRDI QIDQ4027646FDOQ4027646
Mikhail Anatolievich Tsfasman, Serge Vlăduţ, Igor E. Shparlinski
Publication date: 21 February 1993
Title of this publication is not available (Why is that?)
codesmultiplicative complexityShimura curvessupercodesbilinear multiplication algorithmcurves over finite fields with many points
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Curves over finite and local fields (11G20) Finite ground fields in algebraic geometry (14G15) Computational aspects of algebraic curves (14Q05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Arithmetic ground fields for curves (14H25)
Cited In (36)
- Construction of asymmetric Chudnovsky-type algorithms for multiplication in 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
- Title not available (Why is that?)
- Arcs and curves over a finite field
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
- On the bounds of the bilinear complexity of multiplication in some finite fields
- Multiplication of polynomials modulo \(x^n\)
- An improvement of bilinear complexity bounds in some finite fields.
- On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- A formula for constructing curves over finite fields with many rational points
- On the bilinear complexity of the multiplication in small finite fields
- A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line
- Curves with many points and configurations of hyperplanes over finite fields
- Chaining multiplications in finite fields with Chudnovsky-type algorithms and tensor rank of the \(k\)-multiplication
- On the tensor rank of the multiplication in the finite fields
- Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity
- On multiplication in finite fields
- Multiplication algorithm in a finite field and tensor rank of the multiplication.
- Trisymmetric multiplication formulae in finite fields
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
- The equivariant complexity of multiplication in finite field extensions
- Faster Polynomial Multiplication via Discrete Fourier Transforms
- The quadratic hull of a code and the geometric view on multiplication algorithms
- Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication
- Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of \(\mathbb F_q\)
- 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\)
- On the tensor rank of multiplication in any extension of \(\mathbb F_2\)
- On some bounds for symmetric tensor rank of multiplication in finite fields
- New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields
- Curves with more than one inner Galois point
- Complexity of computation in finite fields
- An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4027646)
