On the cut-off point for combinatorial group testing
From MaRDI portal
Recommendations
Cites work
- A Boundary Problem for Group Testing
- How many queries are needed to learn?
- scientific article; zbMATH DE number 4057247 (Why is no real title available?)
- scientific article; zbMATH DE number 3209689 (Why is no real title available?)
- scientific article; zbMATH DE number 3264611 (Why is no real title available?)
- scientific article; zbMATH DE number 3388411 (Why is no real title available?)
- Learning in the presence of finitely or infinitely many irrelevant attributes
- Minimizing a Combinatorial Function
- On the Detection of Defective Members of Large Populations
- Queries and concept learning
- The cutoff point for group testing
Cited in
(8)- On parallel attribute-efficient learning.
- Strict group testing and the set basis problem
- Upper and lower bounds for competitive group testing
- Two new perspectives on multi-stage group testing
- Cutoff Point and Monotonicity Properties for Multinomial Group Testing
- On the cutoff point for pairwise enabling in multiple access systems
- scientific article; zbMATH DE number 823957 (Why is no real title available?)
- Pooled Testing and Its Applications in the COVID-19 Pandemic
This page was built for publication: On the cut-off point for combinatorial group testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283788)