Pages that link to "Item:Q4015275"

The following pages link to A classification of algorithms for multiplying polynomials of small degree over finite fields (Q4015275):

Displaying 5 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)
• Multiplicative complexity of direct sums of quadratic systems (Q1347225) (← links)
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
• Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic (Q3167412) (← links)
• On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic (Q5382575) (← links)