On the cut-off point for combinatorial group testing

DOI10.1016/S0166-218X(98)00119-XzbMath0924.68170OpenAlexW2088027806MaRDI QIDQ1283788

Ingo Wegener, Norbert Klasner, Paul Fischer

Publication date: 30 March 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00119-x

zbMATH Keywords

group testing problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (5)

Pooled Testing and Its Applications in the COVID-19 Pandemic ⋮ Two new perspectives on multi-stage group testing ⋮ On parallel attribute-efficient learning. ⋮ Upper and lower bounds for competitive group testing ⋮ Strict group testing and the set basis problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning in the presence of finitely or infinitely many irrelevant attributes
• Queries and concept learning
• On the Detection of Defective Members of Large Populations
• The cutoff point for group testing
• How many queries are needed to learn?
• Minimizing a Combinatorial Function
• A Boundary Problem for Group Testing

This page was built for publication: On the cut-off point for combinatorial group testing