Hu–Hwang–Wang cutoff-point conjecture for adaptive group testing
Statement
Let be a finite set of items, with defective items, and let denote the minimum, over adaptive group-testing algorithms, of the worst-case number of tests needed to identify all defectives. Set .
Hu–Hwang–Wang cutoff-point conjecture. For ,
This conjecture asserts that, up to the cutoff ratio , testing items individually is optimal. The statement was proved for by Du and Hwang, so the full conjecture is resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.