Pages that link to "Item:Q751615"
From MaRDI portal
The following pages link to Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields (Q751615):
Displaying 3 items.
- Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems (Q579215) (← links)
- On the bounds of the bilinear complexity of multiplication in some finite fields (Q1762551) (← links)
- On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field (Q2191009) (← links)