Academic Commons

Reports

Solution of Ulam's Problem on Binary Search with Four Lies

Auletta, Vincenzo; Negro, Alberto; Parlati, Giuseppe

In this paper we determine the minimal number of yes-no queries needed to find an unknown integer between 1 and 1000000 if at most four of the answers may be erroneous.

Subjects

Files

More About This Work

Academic Units
Computer Science
Publisher
Department of Computer Science, Columbia University
Series
Columbia University Computer Science Technical Reports, CUCS-034-93
Published Here
January 27, 2012
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.