Lower bounds for identifying subset members with subset queries

@inproceedings{Knill1995LowerBF,
  title={Lower bounds for identifying subset members with subset queries},
  author={Emanuel Knill},
  booktitle={SODA},
  year={1995}
}
An instance of a group testing problem is a set of objects 0 and an unknown subset P of 0. The task is to determine P by using queries of the type ‘Ldoes P intersect Q”, where Q is a subset of 0. This problem occurs in areas such as fault detection, multiaccess communications, optimal search, blood testing and chromosome mapping. Consider the two stage algorithm for solving a group testing problem. In the first stage a predetermined set of queries are asked in parallel and in the second stage… CONTINUE READING
25 Citations
0 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…