ConceptTheory & Algos
K-wise independence
A property where for any k distinct output positions, the joint probability distribution equals the uniform distribution of k bits.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Erik Demaine
A property of a hash family where any subset of k keys behave as if they are independently hashed, with collision probability bounded by .
Connections
7The lectures that define it or assume it, and the concepts next to it.