Pages that link to "Item:Q4327377"
From MaRDI portal
The following pages link to A fast algorithm to compute irreducible and primitive polynomials in finite fields (Q4327377):
Displaying 6 items.
- Algorithm for studying polynomial maps and reductions modulo prime number (Q2117423) (← links)
- Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field (Q2985816) (← links)
- (Q3570803) (← links)
- (Q3641494) (← links)
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) (Q4521516) (← links)
- A polynomial time algorithm for computing the HNF of a module over the integers of a number field (Q5244519) (← links)