Pages that link to "Item:Q1045890"
From MaRDI portal
The following pages link to Efficient polynomial time algorithms computing industrial-strength primitive roots (Q1045890):
Displaying 6 items.
- On the existence of pairs of primitive normal elements over finite fields (Q2107674) (← links)
- Roots of unity in orders (Q2362292) (← links)
- Algorithms for relatively cyclotomic primes (Q2843822) (← links)
- Searching for Primitive Roots in Finite Fields (Q3987942) (← links)
- An elliptic curve analogue of Pillai’s lower bound on primitive roots (Q5079426) (← links)
- Computing the unit group of a commutative finite \(\mathbb{Z}\)-algebra (Q6601476) (← links)
