Pages that link to "Item:Q1177865"
From MaRDI portal
The following pages link to An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\) (Q1177865):
Displaying 11 items.
- An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields (Q818142) (← links)
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields (Q1198957) (← links)
- Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15 (Q1612116) (← links)
- Boosting the margin: a new explanation for the effectiveness of voting methods (Q1807156) (← 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 tensor rank of multiplication in any extension of \(\mathbb F_2\) (Q2431340) (← links)
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields (Q2788750) (← 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 strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line (Q5880200) (← links)
