Certain systems of bilinear forms whose minimal algorithms are all quadratic

DOI10.1016/0196-6774(83)90041-XMaRDI QIDQ3667942zbMATH OpenOpenAlexFDO

Authors Ephraim Feig

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

zbMATH Keywords

algebraic complexitybilinear formfinite algebraic extension fieldminimal algorithm

Mathematics Subject Classification ID

Algebraic field extensions (12F05) Analysis of algorithms and problem complexity (68Q25)

Cited in

(3)

• 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

This page was built for publication: Certain systems of bilinear forms whose minimal algorithms are all quadratic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3667942)