The following pages link to (Q4027646):
Displaying 29 items.
- Complexity of computation in finite fields (Q378003) (← links)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (Q432769) (← links)
- Multiplication of polynomials modulo \(x^n\) (Q551166) (← 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)
- 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)
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\) (Q1808846) (← 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)
- 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)
- (Q3000307) (← links)
- Faster Polynomial Multiplication via Discrete Fourier Transforms (Q3007620) (← links)
- Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication (Q3010380) (← 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)
- On some bounds for symmetric tensor rank of multiplication in finite fields (Q5346821) (← links)
- A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line (Q5880200) (← links)
- (Q6062153) (← links)
