Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions

DOI10.1007/BF01849615zbMath0458.05003OpenAlexW2016529535MaRDI QIDQ1151395

Hans-Dietrich O. F. Gronau

Publication date: 1981

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01849615

zbMATH Keywords

complexitymonotone Boolean functionsSperner-families

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Boolean functions (06E30)

Cites Work

• Some results on Sperner families
• On Sperner families in which no k sets have an empty intersection
• On Sperner families in which no k sets have an empty intersection. II
• On Sperner families in which no k sets have an empty intersection. III
• On Sperner families satisfying an additional condition
• Existence theorems for Sperner families
• A minimization problem concerning subsets of a finite set
• Two applications (for search theory and truth functions) of Sperner type theorems
• Extensions of the Erdös-Ko-Rado Theorem
• A short proof of Sperner's lemma
• A Combinatorial Theorem on Systems of Sets
• A finite set covering theorem II

This page was built for publication: Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions