Pages that link to "Item:Q3478495"

The following pages link to Multiplication of Polynomials over Finite Fields (Q3478495):

Displaying 10 items.

• Composed products and module polynomials over finite fields (Q686146) (← links)
• Polynomial multiplication over finite fields: from quadratic to straight-line complexity (Q862343) (← links)
• Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u]/<Q(u)^{\ell}>\), \(\ell >1\) (Q1110328) (← links)
• Univariate polynomial factorization over finite fields (Q1127311) (← links)
• Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u]/\langle{} u^ n \rangle\) (Q1178708) (← links)
• Results on multiples of primitive polynomials and their products over GF(2) (Q2566016) (← links)
• Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial (Q3776615) (← 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)
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator (Q5432372) (← links)