The covering problem of complete uniform hypergraphs

DOI10.1016/0012-365X(79)90074-8zbMath0412.05031MaRDI QIDQ1259552

Marc Snir

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypergraphcoveringBoolean formulae

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of packing and covering (05B40)

Related Items

\(\Sigma\Pi\Sigma\) threshold formulas ⋮ Better lower bounds for monotone threshold formulas ⋮ Construction of universal enumerators and formulas for threshold functions ⋮ Bipartite Hansel results for hypergraphs ⋮ Improved bounds for covering complete uniform hypergraphs ⋮ Finite difference time domain algorithm for electromagnetic problems involving material movement ⋮ On the depth complexity of formulas

Cites Work

• An information-theoretic method in combinatorial theory
• Unnamed Item
• Unnamed Item
• Unnamed Item