Multiplicative complexity of polynomial multiplication over finite fields
From MaRDI portal
Recommendations
- On the complexity of multiplication in finite fields
- Multiplication of Polynomials over Finite Fields
- Polynomial multiplication over finite fields: from quadratic to straight-line complexity
- STACS 2005
- A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields
- Polynomial multiplication over finite fields in time O(n n)
- The equivariant complexity of multiplication in finite field extensions
- scientific article; zbMATH DE number 2231494
- Faster polynomial multiplication over finite fields
Cited in
(22)- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- Computing polynomials with few multiplications
- Hardness of Reconstructing Multivariate Polynomials over Finite Fields
- 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\)
- Multiplication of polynomials modulo \(x^n\)
- Polynomial evaluation over finite fields: new algorithms and complexity bounds
- A classification of algorithms for multiplying polynomials of small degree over finite fields
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
- Faster polynomial multiplication over finite fields
- A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields
- Multiplication of Polynomials over Finite Fields
- STACS 2005
- Multiplicative complexity of direct sums of quadratic systems
- Concrete Multiplicative Complexity of Symmetric Functions
- Multiplicative complexity of vector valued Boolean functions
- Complexity of multiplication in commutative group algebras over fields of prime characteristic
- A lower bound for the multiplication of polynomials modulo a polynomial
- Polynomial multiplication over finite fields: from quadratic to straight-line complexity
- scientific article; zbMATH DE number 1866875 (Why is no real title available?)
- scientific article; zbMATH DE number 4037188 (Why is no real title available?)
- On the number of distinct functional graphs of affine-linear transformations over finite fields
- On the multiplicative complexity of polynomials
This page was built for publication: Multiplicative complexity of polynomial multiplication over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3832671)
