Pages that link to "Item:Q3063600"
From MaRDI portal
The following pages link to COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY (Q3063600):
Displaying 9 items.
- An efficient randomized group testing procedure to determine the number of defectives (Q408399) (← links)
- Learning a hidden graph (Q479267) (← links)
- A new randomized algorithm for group testing with unknown number of defective items (Q2352359) (← links)
- An efficient FPRAS type group testing procedure to approximate the number of defectives (Q2444143) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Upper and lower bounds for competitive group testing (Q2700623) (← links)
- Randomized Group Testing Both Query-Optimal and Minimal Adaptive (Q2891370) (← links)
- BOUNDS FOR NONADAPTIVE GROUP TESTS TO ESTIMATE THE AMOUNT OF DEFECTIVES (Q2905282) (← links)
- Improved lower bound for estimating the number of defective items (Q6606192) (← links)
