scientific article; zbMATH DE number 125907
From MaRDI portal
Publication:4027646
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)
Recommendations
- 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
- An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
- Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
- scientific article; zbMATH DE number 606784
Cited in
(40)- 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
- Algebraic complexities and algebraic curves over finite fields
- scientific article; zbMATH DE number 5529005 (Why is no real title available?)
- On some bounds for symmetric tensor rank of multiplication in finite fields
- Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15
- 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
- scientific article; zbMATH DE number 606784 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 5896947 (Why is no real title available?)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- scientific article; zbMATH DE number 7758331 (Why is no real title available?)
- A formula for constructing curves over finite fields with many rational points
- Faster polynomial multiplication via discrete Fourier transforms
- 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
- Group-theoretic lower bounds for the complexity of matrix multiplication
- Curves with many points and configurations of hyperplanes over finite fields
- On the tensor rank of the multiplication in the finite fields
- On multiplication in finite fields
- 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
- Multiplication algorithm in a finite field and tensor rank of the multiplication.
- Trisymmetric multiplication formulae in finite fields
- Multiplication in small finite fields using elliptic curves
- The equivariant complexity of multiplication in finite field extensions
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
- The quadratic hull of a code and the geometric view on multiplication algorithms
- Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of 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\)
- Curves with more than one inner Galois point
- New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields
- 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)
