The following pages link to Sets pooling designs (Q1306748):
Displaying 21 items.
- An adaptive algorithm for group testing for complexes (Q500957) (← links)
- Almost cover-free codes and designs (Q510471) (← links)
- Learning a hidden uniform hypergraph (Q683922) (← links)
- Pooling designs for clone library screening in the inhibitor complex model (Q719023) (← links)
- Reconstruction of hidden graphs and threshold group testing (Q719032) (← links)
- A competitive algorithm in searching for many edges in a hypergraph (Q869578) (← links)
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032) (← links)
- A class of error-correcting pooling designs over complexes (Q987499) (← links)
- Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
- A group testing method for finding patterns in data (Q1885819) (← links)
- Quaternary splitting algorithm in group testing (Q2025097) (← links)
- Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs (Q2369987) (← links)
- Hypothesis group testing for disjoint pairs (Q2426661) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- A survey on nonadaptive group testing algorithms through the angle of decoding (Q2426664) (← links)
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Non-adaptive Learning of a Hidden Hypergraph (Q2835619) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES (Q3397514) (← links)
- (Q5005098) (← links)
