ConceptTheory & Algos
Modular arithmetic in counting complexity
A proof technique using arithmetic modulo a large integer to bound and recover exact integer values from modular values.
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.