The covering problem of complete uniform hypergraphs

DOI10.1016/0012-365X(79)90074-8zbMATH Open0412.05031MaRDI QIDQ1259552FDOQ1259552

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)