The following pages link to Ulam's searching game with lies (Q1121815):
Displaying 24 items.
- Two cooperative versions of the guessing secrets problem (Q730944) (← links)
- Ulam's searching game with two lies (Q749204) (← links)
- Searching with a forbidden lie pattern in responses (Q751247) (← links)
- Ulam's searching game with a fixed number of lies (Q1184984) (← links)
- Solution of Ulam's problem on binary search with three lies (Q1185893) (← links)
- Searching with lies: The Ulam problem (Q1199612) (← links)
- Group testing with unreliable tests (Q1269106) (← links)
- Logic of infinite quantum systems (Q1325668) (← links)
- A nonadaptive version of Ulam's problem with one lie (Q1360979) (← links)
- Optimal comparison strategies in Ulam's searching game with two errors (Q1391131) (← links)
- Nonadaptive search problem with sets of equal sum (Q1407191) (← links)
- Perfect two-fault tolerant search with minimum adaptiveness (Q1585493) (← links)
- An improved heuristic for the ``Ulam-Rényi game'' (Q1607032) (← links)
- Ulam's searching game with three lies (Q1802349) (← links)
- A problem of minimax estimation with directional information (Q1914304) (← 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)
- Agnostic active learning (Q2517826) (← links)
- The Algebras of Łukasiewicz Many-Valued Logic: A Historical Overview (Q5425998) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- Least adaptive optimal search with unreliable tests (Q5958337) (← links)
- Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies (Q5962511) (← links)
