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\)
DOI10.1016/0304-3975(91)90017-VzbMath0744.68071OpenAlexW4205152297MaRDI QIDQ1178708
Zvi Galil, Shmuel Winograd, Amir Z. Averbuch
Publication date: 26 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90017-v
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items (1)
Cites Work
- 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\)]
- On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
- On varieties of optimal algorithms for the computation of bilinear mappings. III. Optimal algorithms for the computation of \(xy\) and \(yx\) where \(x,y\in M_2(K)\)
- On multiplication in algebraic extension fields
- Certain systems of bilinear forms whose minimal algorithms are all quadratic
- On systems of bilinear forms whose minimal division-free algorithms are all bilinear
- Some bilinear forms whose multiplicative complexity depends on the field of constants
This page was built for publication: 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\)
