Sign inSign in

(L, k, d)-design

A family of n subsets of 1 through l, each of size k, such that any two distinct ones have intersection size at most d.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

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.

Combinatorics2Subset2

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 21:43Hardness vs. Randomness II

Connections

4

The lectures that define it or assume it, and the concepts next to it.

Concepts2

Lectures2

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.