Pages that link to "Item:Q941032"
From MaRDI portal
The following pages link to An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032):
Displaying 11 items.
- Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
- An adaptive algorithm for group testing for complexes (Q500957) (← links)
- Pooling designs for clone library screening in the inhibitor complex model (Q719023) (← links)
- Error-correcting pooling designs associated with some distance-regular graphs (Q967358) (← links)
- A class of error-correcting pooling designs over complexes (Q987499) (← links)
- Nonadaptive algorithms for threshold group testing (Q1028130) (← links)
- An extension of Stein-Lovász theorem and some of its applications (Q1945692) (← links)
- COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY (Q3063600) (← links)
- Threshold and Majority Group Testing (Q4915253) (← links)
- Group Testing with Multiple Mutually-Obscuring Positives (Q4915257) (← links)
- Error-tolerant non-adaptive learning of a hidden hypergraph (Q5005098) (← links)
