Pages that link to "Item:Q1762551"
From MaRDI portal
The following pages link to On the bounds of the bilinear complexity of multiplication in some finite fields (Q1762551):
Displaying 17 items.
- 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)
- On the complexity of multiplication in finite fields (Q1171378) (← 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)
- An improvement of bilinear complexity bounds in some finite fields. (Q1887000) (← links)
- On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field (Q2191009) (← 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)
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields (Q2788750) (← links)
- (Q3000307) (← links)
- A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras (Q3835017) (← links)
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry (Q4992045) (← links)
- New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields (Q5246852) (← links)
- A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields (Q5317184) (← links)
- On some bounds for symmetric tensor rank of multiplication in finite fields (Q5346821) (← links)
