Pages that link to "Item:Q1110328"

The following pages link to 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):

Displayed 4 items.

• 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\) (Q1178708) ‎ (← 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)