Abstract
We find asymptotic formulae for the number of monotone Boolean functions of n variables with a most probable number of terms in the minimal disjunctive normal form. It is proven that the distribution of such functions is asymptotically normal if all monotone Boolean functions are equiprobable. The formulae are different depending on whether n is even or odd.
| Original language | English |
|---|---|
| Pages (from-to) | 463-479 |
| Number of pages | 17 |
| Journal | Discrete Mathematics |
| Volume | 257 |
| Issue number | 2-3 |
| DOIs | |
| State | Published - Nov 28 2002 |
| Externally published | Yes |
| Event | Kleitman and Combinatorics: A Celebration - Cambridge, MA, United States Duration: Aug 16 1990 → Aug 18 1990 |
Keywords
- Asymptotic
- Disjunctive normal form
- Lower unit
- Monotone boolean function
Fingerprint
Dive into the research topics of 'On the distribution of the number of monotone Boolean functions relative to the number of lower units'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver