DOIAbstract
AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown integer between 1 and 2m 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 2m if at most three of the answers may be erroneous
The Ulam-Rényi game is a classical model for the problem of finding an unknown number in a finite se...
The Rényi–Berlekamp–Ulam game is a classical model for the problem of determining the minimum number...
The Ulam-Renyi game is a classical model for the problem of determining the min- imum number of quer...
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...
AbstractUlam's problem is to determine the minimal number of yes-no queries sufficient to find an un...
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...
AbstractPaul tries to find an unknown x from l to n by asking q Yes-No questions. In response Carole...
Deppe C. Strategies for the Renyi-Ulam Game with fixed number of lies. THEORETICAL COMPUTER SCIENCE....
We study the problem of identifying an initially unknown m-bit number by using yes-no questions when...
AbstractSuppose x is an n-bit integer. By a comparison question we mean a question of the form “does...
AbstractWe consider the problem of finding the minimal number Ll(M) of binary questions needed to fi...
The Ulam-Rényi game is a classical model for the problem of finding an unknown number in a finite se...
The Rényi–Berlekamp–Ulam game is a classical model for the problem of determining the minimum number...
The Ulam-Renyi game is a classical model for the problem of determining the min- imum number of quer...
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...
AbstractUlam's problem is to determine the minimal number of yes-no queries sufficient to find an un...
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...
AbstractPaul tries to find an unknown x from l to n by asking q Yes-No questions. In response Carole...
Deppe C. Strategies for the Renyi-Ulam Game with fixed number of lies. THEORETICAL COMPUTER SCIENCE....
We study the problem of identifying an initially unknown m-bit number by using yes-no questions when...
AbstractSuppose x is an n-bit integer. By a comparison question we mean a question of the form “does...
AbstractWe consider the problem of finding the minimal number Ll(M) of binary questions needed to fi...
The Ulam-Rényi game is a classical model for the problem of finding an unknown number in a finite se...
The Rényi–Berlekamp–Ulam game is a classical model for the problem of determining the minimum number...
The Ulam-Renyi game is a classical model for the problem of determining the min- imum number of quer...
Add to ORKG