ConceptTheory & Algos
Shoup's deterministic algorithm
A deterministic algorithm running in time polynomial in l and p that finds an irreducible polynomial of degree l in [X].
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.