Pages that link to "Item:Q1178708"

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. II: The algebra \(G[u]/\langle{} u^ n \rangle\) (Q1178708):

Displaying 5 items.

• Multiplication of polynomials modulo \(x^n\) (Q551166) (← links)
• 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)
• An efficient algorithm for product computations on computer (Q1132160) (← links)
• Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial (Q3776615) (← links)
• A classification of algorithms for multiplying polynomials of small degree over finite fields (Q4015275) (← links)