Boolean functions
Functions from {0,1}^n to {0,1}: counting monotone, self-dual and unate Boolean functions and Dedekind numbers, enumeration of k-SAT functions, noise stability and juntas, and parity and small-bias counts over finite fields.
- Dedekind numbers
- Enumeration of k-SAT functions
- Junta approximation of monotone Boolean functions
- Majority is least stable conjecture
- OSSS inequality for decision trees
- Kahn–Kalai–Linial inequality
- Parity counts over finite fields
- Parity products modulo powers of two
- Self-dual monotone Boolean functions
- Unate and monotone Boolean functions
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.