ConceptTheory & Algos
Learning width-w DNFs
Width-w DNFs are learnable from random examples in time polynomial in n to the w over epsilon.
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.