






























We consider Bernoulli nonadaptive group testing with $k = Θ(n^θ)$ defectives, for $θ\in (0,1)$. The practical definite defectives (DD) detection algorithm is known to be optimal for $θ\geq 1/2$. We give a new upper bound on the rate of DD, showing that DD is strictly suboptimal for $θ< 0.41$. We also show that the SCOMP algorithm and algorithms based on linear programming achieve a rate at least as high as DD, so in particular are also optimal for $θ\geq 1/2$.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。