Lower Bound for Non-Adaptive Estimate the Number of Defective Items

摘要

We prove that to estimate within a constant factor the number of defective items in a non-adaptive group testing algorithm we need at least (( log n )( log (1 ))) tests. This solves the open problem posed by Damaschke and Sheikh Muhammad.