The following pages link to (Q3776615):
Displaying 4 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\) (Q1110328) (← links)
- A lower bound for the multiplication of polynomials modulo a polynomial (Q1197994) (← links)
- On the direct sum conjecture in the straight line model (Q1265137) (← links)
- Multiplicative complexity of direct sums of quadratic systems (Q1347225) (← links)