DOIAbstract
AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown integer between 1 and 1000000 if at most three of the answers may be erroneous
AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown integer between 1 and 1000000 if at most three of the answers may be erroneous
AbstractWe consider the problem of finding the minimal number Ll(M) of binary questions needed to fi...
We consider the problem of determining the minimum number of queries to find an unknown number in a ...
AbstractSuppose x is an n-bit integer. By a comparison question we mean a question of the form “does...
AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown in...
AbstractUlam's problem is to determine the minimal number of yes-no queries sufficient to find an un...
AbstractWe determine the minimal number of yes-no queries sufficient to find an unknown integer betw...
AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown in...
In this paper we determine the minimal number of yes-no queries needed to find an unknown integer be...
AbstractIn this paper we determine the minimal number of yes–no queries that are needed to find an u...
AbstractSomeone thinks of a number between one and one million (which is just less than 220). Anothe...
Deppe C. Strategies for the Renyi-Ulam Game with fixed number of lies. THEORETICAL COMPUTER SCIENCE....
A transmission strategy that allows the sender to deliver any of M messages to the receiver over a b...
Cicalese F, Deppe C. Quasi-perfect minimally adaptive q-ary search with unreliable tests. In: Algor...
AbstractPaul tries to find an unknown x from l to n by asking q Yes-No questions. In response Carole...
AbstractLetft(n) be the number of questions necessary to find an unknown element out of a set ofnele...
AbstractWe consider the problem of finding the minimal number Ll(M) of binary questions needed to fi...
We consider the problem of determining the minimum number of queries to find an unknown number in a ...
AbstractSuppose x is an n-bit integer. By a comparison question we mean a question of the form “does...
AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown in...
AbstractUlam's problem is to determine the minimal number of yes-no queries sufficient to find an un...
AbstractWe determine the minimal number of yes-no queries sufficient to find an unknown integer betw...
AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown in...
In this paper we determine the minimal number of yes-no queries needed to find an unknown integer be...
AbstractIn this paper we determine the minimal number of yes–no queries that are needed to find an u...
AbstractSomeone thinks of a number between one and one million (which is just less than 220). Anothe...
Deppe C. Strategies for the Renyi-Ulam Game with fixed number of lies. THEORETICAL COMPUTER SCIENCE....
A transmission strategy that allows the sender to deliver any of M messages to the receiver over a b...
Cicalese F, Deppe C. Quasi-perfect minimally adaptive q-ary search with unreliable tests. In: Algor...
AbstractPaul tries to find an unknown x from l to n by asking q Yes-No questions. In response Carole...
AbstractLetft(n) be the number of questions necessary to find an unknown element out of a set ofnele...
AbstractWe consider the problem of finding the minimal number Ll(M) of binary questions needed to fi...
We consider the problem of determining the minimum number of queries to find an unknown number in a ...
AbstractSuppose x is an n-bit integer. By a comparison question we mean a question of the form “does...
Add to ORKG