Name
Abstract | ||
|---|---|---|
A set system is said to be separating if for every pair of distinct elements ,∈[] there exists a set such that contains exactly one of them. The search complexity of a separating system is the minimum number of questions of type “∈?” (where ) needed in the worst case to determine a hidden element ∈[]. If we receive the answer before asking a new question then we speak of the complexity, denoted by ; if the questions are all fixed beforehand then we speak of the complexity, denoted by . If we are allowed to ask the questions in at most rounds then we speak of the - complexity of , denoted by . It is clear that . A group of problems raised by G.O.H. Katona is to characterize those separating systems for which some of these inequalities are tight. In this paper we are discussing set systems with the property for any ≥3. We give a necessary condition for this property by proving a theorem about traces of hypergraphs which also has its own interest. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s00453-013-9750-y | Algorithmica |
Keywords | DocType | Volume |
Search,Group testing,Adaptivity,Rounds | Journal | 67 |
Issue | ISSN | Citations |
3 | 0178-4617 | 3 |
PageRank | References | Authors |
0.52 | 6 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gábor Wiener | 1 | 64 | 10.65 |