An algorithmic construction of union-intersection-bounded families

DOI10.1016/J.TCS.2024.114817MaRDI QIDQ6615223

Sebastià Martín, Marcel Fernández, John Livieratos

Publication date: 8 October 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Lovász local lemmacover-free familysuperimposed distance codeunion-intersection-bounded family

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of packing and covering (05B40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Theory of computing (68Qxx)

Cites Work

• On certain inequalities involving the constant \(e\) and their applications
• Union-intersection-bounded families and their applications
• Directed Lovász local lemma and Shearer's lemma
• A constructive proof of the general lovász local lemma
• The Lovász Local Lemma and Satisfiability
• A constructive proof of the Lovász local lemma
• Upper Bounds on the Size of Covering Arrays
• Nonrandom binary superimposed codes
• Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: An algorithmic construction of union-intersection-bounded families

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