Revisiting Sequential Search Using Question-sets with Bounded Intersections
The number of yes-no questions needed to find sequentially an unknown element of a set of size n with the restriction that the intersection of any m question-sets can be at most k is denoted by N. Given N, m and k we give the exact value of the biggest n for which N questions are still enough. We also give an almost exact formula for the smallest N if we know n, m and k.
AMS Subject Classification90B40
Unable to display preview. Download preview PDF.
- Katona, G., 1976. Search using sets with small intersection, Colleques Internat, C.N.R.S. No. 276, Theorie de l’information.Google Scholar