Pages that link to "Item:Q2369987"
From MaRDI portal
The following pages link to Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs (Q2369987):
Displayed 14 items.
- Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
- Non-adaptive complex group testing with multiple positive sets (Q393127) (← links)
- An adaptive algorithm for group testing for complexes (Q500957) (← links)
- Pooling designs for clone library screening in the inhibitor complex model (Q719023) (← links)
- Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
- The optimal number of items in a group for group testing (Q2231009) (← links)
- On the complexity and approximation of non-unique probe selection using \(d\)-disjunct matrix (Q2271139) (← links)
- Strict group testing and the set basis problem (Q2452424) (← 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)
- Non-adaptive Complex Group Testing with Multiple Positive Sets (Q3010399) (← links)
- Almost Optimal Cover-Free Families (Q5283363) (← links)
