Pages that link to "Item:Q3832671"

The following pages link to Multiplicative complexity of polynomial multiplication over finite fields (Q3832671):

Displaying 21 items.

• Multiplication of polynomials modulo \(x^n\) (Q551166) (← links)
• Polynomial evaluation over finite fields: new algorithms and complexity bounds (Q694568) (← 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)
• 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)
• A lower bound for the multiplication of polynomials modulo a polynomial (Q1197994) (← links)
• Multiplicative complexity of direct sums of quadratic systems (Q1347225) (← links)
• Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
• On the number of distinct functional graphs of affine-linear transformations over finite fields (Q2637117) (← links)
• Computing polynomials with few multiplications (Q2913800) (← links)
• Complexity of multiplication in commutative group algebras over fields of prime characteristic (Q2997866) (← links)
• Hardness of Reconstructing Multivariate Polynomials over Finite Fields (Q3068644) (← links)
• Multiplication of Polynomials over Finite Fields (Q3478495) (← links)
• Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial (Q3776615) (← links)
• A classification of algorithms for multiplying polynomials of small degree over finite fields (Q4015275) (← links)
• (Q4792309) (← links)
• A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields (Q5317184) (← links)
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator (Q5432372) (← links)
• STACS 2005 (Q5710701) (← links)
• Concrete Multiplicative Complexity of Symmetric Functions (Q5756689) (← links)