Publication:3776615
From MaRDI portal
zbMath0636.68035MaRDI QIDQ3776615
Amir Z. Averbuch, Zvi Galil, Shmuel Winograd
Publication date: 1986
bilinear algorithms; multiplication of polynomials; bilinear forms on finite-dimensional vector spaces over a field
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
65F99: Numerical linear algebra
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\)], A lower bound for the multiplication of polynomials modulo a polynomial, On the direct sum conjecture in the straight line model, Multiplicative complexity of direct sums of quadratic systems