On systems of bilinear forms whose minimal division-free algorithms are all bilinear

DOI10.1016/0196-6774(81)90026-2zbMath0476.68029OpenAlexW2021964609MaRDI QIDQ3932296

Ephraim Feig

Publication date: 1981

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(81)90026-2

zbMATH Keywords

bilinear algorithmscomputing products in finite algebraic extension fieldscomputing the products of Toeplitz and Hankel matrices with vectorsmultiplicative complexity of the quaternion product

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic field extensions (12F05) Quadratic and bilinear forms, inner products (15A63) Arithmetic theory of polynomial rings over finite fields (11T55) Algorithms in computer science (68W99)

Related Items (7)

Multiplicative complexity of direct sums of quadratic systems ⋮ 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\)] ⋮ Commutative algebras of minimal rank ⋮ 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\)] ⋮ Modified FFTs for Fused Multiply-Add Architectures ⋮ On the direct sum conjecture in the straight line model ⋮ On the direct sum conjecture

This page was built for publication: On systems of bilinear forms whose minimal division-free algorithms are all bilinear