Pages that link to "Item:Q1808846"
From MaRDI portal
The following pages link to Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\) (Q1808846):
Displaying 30 items.
- Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm (Q512336) (← links)
- An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields (Q818142) (← links)
- On the tensor rank of the multiplication in the finite fields (Q927729) (← links)
- On multiplication in finite fields (Q964921) (← links)
- Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of \(\mathbb F_q\) (Q1414023) (← links)
- Multiplication algorithm in a finite field and tensor rank of the multiplication. (Q1425092) (← links)
- A tower with non-Galois steps which attains the Drinfeld-Vladut bound (Q1434342) (← links)
- Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15 (Q1612116) (← links)
- 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\) (Q1689585) (← links)
- Dense families of modular curves, prime numbers and uniform symmetric tensor rank of multiplication in certain finite fields (Q1727366) (← links)
- Gaps between prime numbers and tensor rank of multiplication in finite fields (Q1727373) (← links)
- On the bounds of the bilinear complexity of multiplication in some finite fields (Q1762551) (← links)
- An improvement of bilinear complexity bounds in some finite fields. (Q1887000) (← links)
- On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation (Q2012337) (← links)
- Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields (Q2099149) (← links)
- Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields (Q2120984) (← links)
- On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields (Q2175409) (← links)
- Trisymmetric multiplication formulae in finite fields (Q2232213) (← links)
- On the tensor rank of multiplication in any extension of \(\mathbb F_2\) (Q2431340) (← links)
- On the bilinear complexity of the multiplication in small finite fields (Q2506478) (← links)
- The equivariant complexity of multiplication in finite field extensions (Q2693365) (← links)
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields (Q2788750) (← links)
- SINGULAR CURVES WITH LINE BUNDLES L DEFINED OVER ${\mathbb F}_q$ AND WITH H<sup>0</sup>(L) = H<sup>1</sup>(L) = 0 (Q2853424) (← links)
- Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves (Q4027853) (← links)
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry (Q4992045) (← links)
- The quadratic hull of a code and the geometric view on multiplication algorithms (Q5043439) (← links)
- New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields (Q5246852) (← links)
- Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm (Q5270844) (← links)
- On some bounds for symmetric tensor rank of multiplication in finite fields (Q5346821) (← links)
- Determinantal polynomials and the base polynomial of a square matrix over a finite field (Q6573856) (← links)