Advertisement

Journal of Statistical Theory and Practice

, Volume 1, Issue 2, pp 199–204 | Cite as

Revisiting Sequential Search Using Question-sets with Bounded Intersections

  • Dömötör Pálvölgyi
Article

Abstract

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 Classification

90B40 

Keywords

Sequential search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Katona, G., 1966. On separating systems of a finite set, Journal of Combinatorial Theory, v. 1, 174–194.MathSciNetCrossRefGoogle Scholar
  2. Katona, G., 1976. Search using sets with small intersection, Colleques Internat, C.N.R.S. No. 276, Theorie de l’information.Google Scholar
  3. Sebő, A., 1982. Sequential search using question-sets with bounded intersections, Journal of Statistical Planning and Inference 7, 139–150.MathSciNetCrossRefGoogle Scholar

Copyright information

© Grace Scientific Publishing 2007

Authors and Affiliations

  1. 1.Inst. of Mathematics, Comm. Networks LabEötvös Loránd UniversityBudapestHungary

Personalised recommendations