The following pages link to (Q5706775):
Displaying 7 items.
- Polynomial multiplication over finite fields: from quadratic to straight-line complexity (Q862343) (← links)
- On the bounds of the bilinear complexity of multiplication in some finite fields (Q1762551) (← links)
- On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation (Q2012337) (← links)
- On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field (Q2191009) (← links)
- (Q3000307) (← links)
- Multiplicative complexity of polynomial multiplication over finite fields (Q3832671) (← links)
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry (Q4992045) (← links)
