On systems of bilinear forms whose minimal division-free algorithms are all bilinear
From MaRDI portal
Publication:3932296
DOI10.1016/0196-6774(81)90026-2zbMath0476.68029MaRDI QIDQ3932296
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
bilinear algorithms; computing products in finite algebraic extension fields; computing the products of Toeplitz and Hankel matrices with vectors; multiplicative complexity of the quaternion product
68Q25: Analysis of algorithms and problem complexity
12F05: Algebraic field extensions
15A63: Quadratic and bilinear forms, inner products
11T55: Arithmetic theory of polynomial rings over finite fields
68W99: Algorithms in computer science
Related Items
Modified FFTs for Fused Multiply-Add Architectures, Commutative algebras of minimal rank, On the direct sum conjecture, 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, Multiplicative complexity of direct sums of quadratic systems
