On Nonadaptive Search Problem

Kolev, Emil. "On Nonadaptive Search Problem." Serdica Mathematical Journal 29.4 (2003): 361-376. <http://eudml.org/doc/219658>.

@article{Kolev2003,
abstract = {2000 Mathematics Subject Classification: 91A46, 91A35.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.},
author = {Kolev, Emil},
journal = {Serdica Mathematical Journal},
keywords = {Search; Nonadaptive Search; Nonadaptive search},
language = {eng},
number = {4},
pages = {361-376},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {On Nonadaptive Search Problem},
url = {http://eudml.org/doc/219658},
volume = {29},
year = {2003},
}

TY - JOUR
AU - Kolev, Emil
TI - On Nonadaptive Search Problem
JO - Serdica Mathematical Journal
PY - 2003
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 29
IS - 4
SP - 361
EP - 376
AB - 2000 Mathematics Subject Classification: 91A46, 91A35.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.
LA - eng
KW - Search; Nonadaptive Search; Nonadaptive search
UR - http://eudml.org/doc/219658
ER -