Improved lower bound for estimating the number of defective items

DOI10.1007/978-3-031-49611-0_22MaRDI QIDQ6606192

Nader H. Bshouty

Publication date: 16 September 2024

zbMATH Keywords

estimationrandomized algorithmgroup testing

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fault-tolerant search algorithms. Reliable computation with unreliable information
• A group testing method for finding patterns in data
• An efficient FPRAS type group testing procedure to approximate the number of defectives
• COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY
• Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
• A Sequential Method for Screening Experimental Variables
• Born again group testing: Multiaccess communications
• The Power of an Example
• Nonrandom binary superimposed codes
• A Method for Detecting All Defective Members in a Population by Group Testing
• What's hot and what's not: tracking most frequent items dynamically

This page was built for publication: Improved lower bound for estimating the number of defective items

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