We determine the minimal number of yes-no queries sufficient to find an unknown integer between 1 and 2m if at most two of the answers may be erroneous.
Ulam's searching game with lies / D. MUNDICI; A. PELC; J. CZYZOWICZ. - In: JOURNAL OF COMBINATORIAL THEORY. SERIES A. - ISSN 0097-3165. - STAMPA. - 52:(1989), pp. 62-76. [10.1016/0097-3165(89)90062-9]
Ulam's searching game with lies
MUNDICI, DANIELE;
1989
Abstract
We determine the minimal number of yes-no queries sufficient to find an unknown integer between 1 and 2m if at most two of the answers may be erroneous.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
