Optimal detection of a counterfeit coin with multi-arms balances
From MaRDI portal
Publication:1897358
DOI10.1016/0166-218X(94)00010-BzbMath0831.68030WikidataQ126528071 ScholiaQ126528071MaRDI QIDQ1897358
Luisa Gargano, Annalisa De Bonis, Ugo Vaccaro
Publication date: 27 August 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Searching and sorting (68P10) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (8)
Minimum average-case queries of \(q+1\)-ary search game with small sets ⋮ Optimal detection of two counterfeit coins with two-arms balance. ⋮ Minimal average cost of searching for a counterfeit coin: restricted model ⋮ Searching for a counterfeit coin with \(b\)-balance ⋮ Optimal search procedure on coin-weighing problem ⋮ A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance ⋮ Searching for a counterfeit coin with two unreliable weighings ⋮ Searching for two counterfeit coins with two-arms balance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two counterfeit coins
- How to find many counterfeit coins?
- The complexity of parallel search
- Search problems for two irregular coins with incomplete feedback: The underweight model
- An improved algorithm for quantitative group testing
- The average number of weighings to locate a counterfeit coin (Corresp.)
- On various versions of the defective coin problem
- Detection of a Defective Coin with Partial Weight Information
- Optimal Detection of Two Defectives with a Parity Check Device
- Searching for Two Objects by Underweight Feedback
- An improved strategy for a counterfeit coin problem (Corresp.)
- The Counterfeit Coin Problem Revisited
- A Method for the Construction of Minimum-Redundancy Codes
This page was built for publication: Optimal detection of a counterfeit coin with multi-arms balances
