ConceptTheory & Algos
Pollard's factoring algorithm
A faster sub-exponential factoring algorithm developed in 1996.
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.
Exponential vs. polynomial complexity1Prime factorization1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.