Pages that link to "Item:Q2506478"
From MaRDI portal
The following pages link to On the bilinear complexity of the multiplication in small finite fields (Q2506478):
Displaying 11 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 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)
- Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields (Q2120984) (← links)
- Normal bases from 1-dimensional algebraic groups (Q2188980) (← links)
- On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field (Q2191009) (← links)
- Elliptic periods for finite fields (Q2517811) (← links)
- On "A new representation of elements of finite fields GF(2/sup m/) yielding small complexity arithmetic circuits" (Q4571241) (← links)
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry (Q4992045) (← links)
