The following pages link to Ulam's searching game with two lies (Q749204):
Displaying 20 items.
- \(Q\)-ary Rényi-Ulam pathological liar game with one lie (Q628343) (← links)
- Searching with a forbidden lie pattern in responses (Q751247) (← links)
- Detecting errors in searching games (Q1119495) (← links)
- Ulam's searching game with a fixed number of lies (Q1184984) (← links)
- Group testing with unreliable tests (Q1269106) (← links)
- Playing by searching: Two strategies against a linearly bounded liar (Q1603717) (← links)
- An improved heuristic for the ``Ulam-Rényi game'' (Q1607032) (← links)
- Minimum number of queries for an adaptive liar search game with small sets (Q1799380) (← links)
- Ulam's searching game with three lies (Q1802349) (← links)
- Strategies for the Renyi--Ulam game with fixed number of lies (Q1884914) (← links)
- Optimal strategies against a liar (Q1978508) (← links)
- On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice (Q2290640) (← links)
- \(Q\)-ary search with one Lie and bi-interval queries (Q2379948) (← links)
- Perfect minimally adaptive \(q\)-ary search with unreliable tests (Q2433824) (← links)
- Searching for a counterfeit coin with two unreliable weighings (Q2565856) (← links)
- The Rényi-Ulam pathological liar game with a fixed number of lies (Q2575810) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies (Q5962511) (← links)
- Correcting a single error in feedback channels (Q6173470) (← links)
