Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions
type: Item
instance of: scholarly article
title: Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions
zbMATH Open document ID: 0458.05003
DOI: 10.1007/BF01849615
author: Hans-Dietrich O. F. Gronau
published in: Periodica Mathematica Hungarica
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 3717318
zbMATH Keywords: monotone Boolean functions
zbMATH Keywords: Sperner-families
zbMATH Keywords: complexity
MaRDI profile type: Publication
cites work: A finite set covering theorem II
cites work: A minimization problem concerning subsets of a finite set
cites work: Existence theorems for Sperner families
cites work: On Sperner families satisfying an additional condition
cites work: Extensions of the Erdös-Ko-Rado Theorem
cites work: On Sperner families in which no k sets have an empty intersection
cites work: On Sperner families in which no k sets have an empty intersection. II
cites work: On Sperner families in which no k sets have an empty intersection. III
cites work: Some results on Sperner families
cites work: Two applications (for search theory and truth functions) of Sperner type theorems
cites work: A short proof of Sperner's lemma
cites work: A Combinatorial Theorem on Systems of Sets
full work available at URL: https://doi.org/10.1007/bf01849615
OpenAlex ID: W2016529535
description: scientific article; zbMATH DE number 3717318