An efficient algorithm for product computations on computer
From MaRDI portal
Recommendations
- 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\)
- 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\)
- Polynomial multiplication over finite fields: from quadratic to straight-line complexity
- Algorithms for the universal decomposition algebra
- On fast multiplication of polynomials over arbitrary algebras
Cites work
Cited in
(2)
This page was built for publication: An efficient algorithm for product computations on computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1132160)