In this paper we determine the minimal number of yes-no queries needed to find an unknown integer between 1 and 2^m if at most three of the answers may be erroneous.
Ulam's Searching Game with Three Lies
SERENO, Matteo
1992-01-01
Abstract
In this paper we determine the minimal number of yes-no queries needed to find an unknown integer between 1 and 2^m if at most three of the answers may be erroneous.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
