ConceptTheory & Algos
Round elimination lemma
A formal statement showing that if a protocol exists for a k-input variant where Alice speaks first with m messages, another protocol exists where Bob speaks first with m-1 messages and slightly higher 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
4The lectures that define it or assume it, and the concepts next to it.