Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives

DOI10.1007/978-3-642-17461-2_10zbMath1310.68089OpenAlexW1926117152MaRDI QIDQ3066450

Azam Sheikh Muhammad, Peter Damaschke

Publication date: 10 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_10

zbMATH Keywords

algorithmlower boundrandomized strategycompetitive group testinglearning by queriesnonadaptive strategy

Mathematics Subject Classification ID

Computational learning theory (68Q32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

Randomized Group Testing Both Query-Optimal and Minimal Adaptive ⋮ Exact learning from an honest teacher that answers membership queries ⋮ An efficient randomized group testing procedure to determine the number of defectives ⋮ An efficient FPRAS type group testing procedure to approximate the number of defectives ⋮ Optimal deterministic group testing algorithms to estimate the number of defectives ⋮ Optimal deterministic group testing algorithms to estimate the number of defectives

This page was built for publication: Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives