Abstract
We consider Ulam's problem of determining the minimum number of yes-no queries to find an unknown integer between 1 and 220 if at most some given number e of the answers may be lies. Previously published papers have solved the problem for cases e=1,2,3 and 4. In this paper we solve the problem for all values of e. © 1998 IEEE.
Cite
CITATION STYLE
APA
Hill, R., Karim, J., & Berlekamp, E. (1998). The solution of a problem of Ulam on searching with lies. In IEEE International Symposium on Information Theory - Proceedings (p. 244). https://doi.org/10.1109/ISIT.1998.708849
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free