Smart elements in combinatorial group testing problems with more defectives
From MaRDI portal
Publication:5121559
DOI10.26493/2590-9770.1363.b06zbMath1458.94200arXiv1705.08539OpenAlexW3081465024MaRDI QIDQ5121559
Publication date: 15 September 2020
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.08539
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two new perspectives on multi-stage group testing
- On regular hypergraphs of high girth
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- Union-free hypergraphs and probability theory
- On the upper bound of the size of the \(r\)-cover-free families
- Smart elements in combinatorial group testing problems
- Some new bounds for cover-free families
- Rounds in a combinatorial search problem
- Identifying defective sets using queries of small size
- Combinatorial Pair Testing: Distinguishing Workers from Slackers
- Secret-Sharing Schemes: A Survey
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
- Optimal Two-Stage Algorithms for Group Testing Problems
- Nonrandom binary superimposed codes
- Minimal completely separating systems
- On a problem concerning separating systems of a finite set
