Almost Optimal Cover-Free Families

DOI10.1007/978-3-319-57586-5_13zbMath1487.68259arXiv1507.07368OpenAlexW2963540524MaRDI QIDQ5283363

Nader H. Bshouty, Ariel Gabizon

Publication date: 21 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.07368

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Algorithms on strings (68W32) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (7)

Component order connectivity in directed graphs ⋮ Unnamed Item ⋮ Non-adaptive learning of a hidden hypergraph ⋮ Deterministic protocols in the SINR model without knowledge of coordinates ⋮ How hard is it to satisfy (almost) all roommates ⋮ Component order connectivity in directed graphs ⋮ Non-adaptive Learning of a Hidden Hypergraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-adaptive complex group testing with multiple positive sets
• Explicit constructions of separating hash families from algebraic curves over finite fields
• Learning a hidden graph using \(O(\log n)\)queries per edge
• Sets pooling designs
• Efficient construction of a small hitting set for combinatorial rectangles in high dimension
• Trivial two-stage group testing for complexes using almost disjunct matrices.
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• A group testing method for finding patterns in data
• On \(r\)-cover-free families
• Some new bounds for cover-free families
• Bounds on the rate of disjunctive codes
• Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
• Non-adaptive Learning of a Hidden Hypergraph
• On r-Simple k-Path
• Linear Time Constructions of Some $$d$$-Restriction Problems
• Testers and their applications
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints
• Faster Algebraic Algorithms for Path and Packing Problems
• Color-coding
• Collusion-secure fingerprinting for digital data
• Explicit Nonadaptive Combinatorial Group Testing Schemes
• Nonrandom binary superimposed codes

This page was built for publication: Almost Optimal Cover-Free Families