Optimality of the Theorem uj1 algorithm for one defective search
Statement
Let denote the minimum number of group-testing queries in the model considered, and let be the query-size parameter. Assume that is an integer and
Optimality conjecture. Under these assumptions, the algorithm used in the proof of Theorem uj1 is optimal for . The preceding discussion indicates that the algorithm seems optimal under the stated condition, while noting counterexamples when is not an integer; the exact values of are otherwise difficult to determine.
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.