Certain systems of bilinear forms whose minimal algorithms are all quadratic
From MaRDI portal
Publication:3667942
DOI10.1016/0196-6774(83)90041-XzbMath0518.68028MaRDI QIDQ3667942
Publication date: 1983
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(83)90041-x
Related Items
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\)], On the direct sum conjecture in the straight line model