Nonadaptive search problem with sets of equal sum

• Autorzy: Emil Kolev
• Języki publikacji: EN

Abstrakty

EN

Consider the set A={1,2,3,…,2n}, n≥3 and let x∈ A be unknown element. For given natural number S we are allowed to ask whether x belongs to a subset B of A such that the sum of the elements of B equals S. We investigate for which S it is possible to find x using a nonadaptive search.

Słowa kluczowe

EN

search; nonadaptive search; 05A05

• Wydawca: De Gruyter Open
• Czasopismo: Open Mathematics
• Rocznik: 2003
• Tom: 1
• Numer: 3
• Strony: 272-283

Daty

wydano

2003-09-01

online

2003-09-01

Twórcy

autor

Emil Kolev

• Bulgarian Academy of Sciences

Bibliografia

• [1] J. Czyzowicz, D. Mundici, A. Pelc: “Ulam’s Searching Game With Lies”, J. Combin. Theory Ser. A, Vol. 52, (1989), pp. 62–76. http://dx.doi.org/10.1016/0097-3165(89)90062-9
• [2] R. Hill and J.P. Karim: “Searching With lies: the Ulam Problem”, Discrete Mathematics, Vol. 106–107, (1992), pp. 273–283. http://dx.doi.org/10.1016/0012-365X(92)90554-S
• [3] E. Kolev: “Nonadaptive Search With Sets of Given Sum”, Proc. ACCT’9, Tsarskoe selo, (2002), pp. 159–162.
• [4] E. Kolev and I. Landgev: “On a Two-Dimensional Search Problem”, Serdica Math. J., Vol. 21, (1995), pp. 219–230.
• [5] M. Ruszinko: “On a 2- and 3- Dimensional Search Problem”, Proc. of the Sixt Joint Swedish-Russian Workshop on Inf. Theory, Aug. 21–27, 1993, Mölle, pp. 437–440.
• [6] J. Spencer: “Guess a Number-With Lying”, Math. Mag., Vol. 57, (1984), pp. 105–108. http://dx.doi.org/10.2307/2689593

Identyfikatory

DOI

10.2478/BF02475209