Solution of Ulam's problem on binary search with two lies
From MaRDI portal
Publication:1114408
DOI10.1016/0097-3165(88)90065-9zbMath0662.68059OpenAlexW2031876674MaRDI QIDQ1114408
Andrzej Pelc, Jurek Czyzowicz, Daniele Mundici
Publication date: 1988
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(88)90065-9
Related Items
\(Q\)-ary search with one Lie and bi-interval queries ⋮ Ulam's searching game with lies ⋮ Solution of Ulam's problem on binary search with three lies ⋮ Searching with lies: The Ulam problem ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies ⋮ Ulam's searching game with three lies ⋮ Ulam's searching game with two lies ⋮ Searching with a forbidden lie pattern in responses ⋮ Group testing with unreliable tests
