COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY (Q3063600): Difference between revisions

@@ Property / cites work @@
+Learning a Hidden Subgraph
@@ Property / cites work: Learning a Hidden Subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+Learning a hidden graph using \(O(\log n)\)queries per edge
+Normal rank
@@ Property / cites work @@
+An upper bound of the number of tests in pooling designs for the error-tolerant complex model
+Normal rank
@@ Property / cites work @@
+Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices
+Normal rank
@@ Property / cites work @@
+On parallel attribute-efficient learning.
@@ Property / cites work: On parallel attribute-efficient learning. / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
+Normal rank
@@ Property / cites work @@
+Optimal Two-Stage Algorithms for Group Testing Problems
+Normal rank
@@ Property / cites work @@
+Modifications of Competitive Group Testing
@@ Property / cites work: Modifications of Competitive Group Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
+Normal rank
@@ Property / cites work @@
+Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
+Normal rank
@@ Property / cites work @@
+On the upper bound of the size of the \(r\)-cover-free families
+Normal rank
@@ Property / cites work @@
+Improved Results for Competitive Group Testing
@@ Property / cites work: Improved Results for Competitive Group Testing / rank @@
+Normal rank