Multiplication of Polynomials over Finite Fields
From MaRDI portal
Recommendations
- Multiplicative complexity of polynomial multiplication over finite fields
- On multiplication in finite fields
- Factorization of Multivariate Polynomials Over Finite Fields
- Multiaffine polynomials over a finite field
- Polynomial multiplicities over finite fields and intersection sets
- Factoring multivariate polynomials over finite fields
- Factoring polynomials over finite fields
- Factoring polynomials over finite fields
- On evaluating multivariate polynomials over finite fields
Cited in
(10)- 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\)
- Univariate polynomial factorization over finite fields
- 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\)
- Results on multiples of primitive polynomials and their products over GF(2)
- scientific article; zbMATH DE number 4037188 (Why is no real title available?)
- Multiplicative complexity of polynomial multiplication over finite fields
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
- Composed products and module polynomials over finite fields
- Polynomial multiplication over finite fields: from quadratic to straight-line complexity
This page was built for publication: Multiplication of Polynomials over Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3478495)
