The covering problem of complete uniform hypergraphs

DOI10.1016/0012-365X(79)90074-8MaRDI QIDQ1259552zbMATH OpenFDO

Authors Marc Snir

Publication date 1979

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

coveringhypergraphBoolean formulae

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3207626 (Why is no real title available?)
• scientific article; zbMATH DE number 3261634 (Why is no real title available?)
• scientific article; zbMATH DE number 3328173 (Why is no real title available?)
• An information-theoretic method in combinatorial theory

Cited in

(7)

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

This page was built for publication: The covering problem of complete uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1259552)