MathDB1 problem
- 0 votes0 replies0 views
The binary-splitting decoding complexity lower-bound conjecture for noisy nonadaptive group testing
Binary-splitting decoding complexity conjecture. To find no false negatives, the decoding algorithm must examine subtrees of depth