ConceptTheory & Algos
Sparse LPN assumption
An assumption that provides an efficient method to generate hard-seeming instances of constraint satisfaction problems.
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.
Håstad's theorem1Learning parity with noise1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.