Pages that link to "Item:Q1171378"

The following pages link to On the complexity of multiplication in finite fields (Q1171378):

Displaying 28 items.

• Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields (Q751615) (← links)
• Polynomial multiplication over finite fields: from quadratic to straight-line complexity (Q862343) (← links)
• On arithmetical algorithms over finite fields (Q910432) (← links)
• On multiplication in finite fields (Q964921) (← links)
• A lower bound for polynomial multiplication (Q1086218) (← links)
• On fast multiplication of polynomials over arbitrary algebras (Q1186518) (← links)
• A lower bound for the multiplication of polynomials modulo a polynomial (Q1197994) (← links)
• Multiplicative complexity of direct sums of quadratic systems (Q1347225) (← links)
• Multiplication algorithm in a finite field and tensor rank of the multiplication. (Q1425092) (← links)
• Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
• Gaps between prime numbers and tensor rank of multiplication in finite fields (Q1727373) (← 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)
• Multiplicity one theorems for GSp(k,2n) and O(k,n), where k is a finite field (Q1824034) (← links)
• Inversion of two level circulant matrices over \(\mathbb{Z}_{p}\) (Q1874655) (← 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)
• The complexity of certain multi-exponentiation techniques in cryptography (Q2499259) (← links)
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
• Inversion of circulant matrices over \(\mathbf{Z}_m\) (Q2719071) (← links)
• Complexity of multiplication in commutative group algebras over fields of prime characteristic (Q2997866) (← links)
• Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18 (Q3506396) (← 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)
• A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields (Q5317184) (← links)
• (Q5446299) (← links)
• STACS 2005 (Q5710701) (← links)
• On the hardness of the finite field isomorphism problem (Q6083668) (← links)