The following pages link to (Q3140455):
Displaying 5 items.
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time (Q2907510) (← links)
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) (Q4521516) (← links)
- Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
- Fast construction of irreducible polynomials over finite fields (Q5917943) (← links)
