Upper and lower bounds for competitive group testing
From MaRDI portal
Recommendations
Cites work
- A Boundary Problem for Group Testing
- An efficient algorithm for combinatorial group testing
- Competitive group testing
- Competitive group testing and learning hidden vertex covers with minimum adaptivity
- scientific article; zbMATH DE number 3662840 (Why is no real title available?)
- scientific article; zbMATH DE number 41347 (Why is no real title available?)
- scientific article; zbMATH DE number 53945 (Why is no real title available?)
- scientific article; zbMATH DE number 1508646 (Why is no real title available?)
- scientific article; zbMATH DE number 2188432 (Why is no real title available?)
- Improved Results for Competitive Group Testing
- Minimizing a Combinatorial Function
- Modifications of Competitive Group Testing
- On the cut-off point for combinatorial group testing
- Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
- Sharper bounds in adpative group testing
Cited in
(4)
This page was built for publication: Upper and lower bounds for competitive group testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2700623)