scientific article
From MaRDI portal
Publication:3776615
zbMath0636.68035MaRDI QIDQ3776615
Amir Z. Averbuch, Zvi Galil, Shmuel Winograd
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
bilinear algorithmsmultiplication of polynomialsbilinear forms on finite-dimensional vector spaces over a field
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Numerical linear algebra (65F99)
Related Items (4)
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\)] ⋮ A lower bound for the multiplication of polynomials modulo a polynomial ⋮ On the direct sum conjecture in the straight line model
This page was built for publication:
