On Nonadaptive Search Problem
Serdica Mathematical Journal, Tome 29 (2003) no. 4, pp. 361-376
Cet article a éte moissonné depuis la source Bulgarian Digital Mathematics Library
We consider nonadaptive search problem for an unknown element x from the set A = {1, 2, 3, . . . , 2^n}, n ≥ 3. For fixed integer S the questions are of the form: Does x belong to a subset B of A, where the sum of the elements of B is equal to S? We wish to find all integers S for which nonadaptive search with n questions finds x. We continue our investigation from [4] and solve the last remaining case n = 2^k , k ≥ 2.
Keywords:
Search, Nonadaptive Search
@article{SMJ2_2003_29_4_a4,
author = {Kolev, Emil},
title = {On {Nonadaptive} {Search} {Problem}},
journal = {Serdica Mathematical Journal},
pages = {361--376},
year = {2003},
volume = {29},
number = {4},
language = {en},
url = {http://geodesic.mathdoc.fr/item/SMJ2_2003_29_4_a4/}
}
Kolev, Emil. On Nonadaptive Search Problem. Serdica Mathematical Journal, Tome 29 (2003) no. 4, pp. 361-376. http://geodesic.mathdoc.fr/item/SMJ2_2003_29_4_a4/