ConceptTheory & Algos
Probabilistic primality testing
A randomized algorithm that determines if an n-bit number is prime in quadratic time with a small probability of error.
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.