Note on generalized group testing
Abstract
In this note, we present a new adaptive algorithm for generalized group testing, which is asymptotically optimal if d=o(2|E|), E is a set of potentially contaminated sets, d is a maximal size of elements of E. Also, we design a 3-stage algorithm, which is asymptotically optimal for d=2.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.