Minimum average-case queries of q+1-ary search game with small sets
From MaRDI portal
(Redirected from Publication:412374)
Minimum average-case queries of \(q+1\)-ary search game with small sets
Minimum average-case queries of \(q+1\)-ary search game with small sets
Recommendations
Cites work
- scientific article; zbMATH DE number 3722661 (Why is no real title available?)
- scientific article; zbMATH DE number 41347 (Why is no real title available?)
- scientific article; zbMATH DE number 65702 (Why is no real title available?)
- scientific article; zbMATH DE number 3625390 (Why is no real title available?)
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
- Five counterfeit coins
- How to find many counterfeit coins?
- Minimal average cost of searching for a counterfeit coin: restricted model
- On separating systems of a finite set
- On separating systems whose elements are sets of at most k elements
- Optimal detection of a counterfeit coin with multi-arms balances
- Optimal detection of two counterfeit coins with two-arms balance.
- Search with small sets in presence of a liar
- Searching games with errors -- fifty years of coping with liars
- Searching with lies
- Two counterfeit coins
Cited in
(2)
This page was built for publication: Minimum average-case queries of \(q+1\)-ary search game with small sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412374)