ConceptTheory & Algos
Miller-Rabin primality test
A randomized polynomial time algorithm to determine whether a number is composite by checking random potential witnesses.
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
4The lectures that define it or assume it, and the concepts next to it.