ConceptTheory & Algos
Bijection CSP (unique games)
A CSP where the domain has size Q and every binary predicate satisfies a bijective property ensuring a unique matching output for each input.
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
2The lectures that define it or assume it, and the concepts next to it.