Searching for two counterfeit coins with two-arms balance
From MaRDI portal
Publication:2576348
DOI10.1016/j.dam.2005.03.009zbMath1085.05004OpenAlexW2008350680MaRDI QIDQ2576348
Wei-Guo Zhang, Wen An Liu, Zan-Kan Nie
Publication date: 27 December 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.03.009
Related Items
Quantum counterfeit coin problems ⋮ Minimal average cost of searching for a counterfeit coin: restricted model ⋮ Searching for a counterfeit coin with \(b\)-balance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized group testing for mutually obscuring defectives
- Two counterfeit coins
- How to find many counterfeit coins?
- The complexity of parallel search
- Five counterfeit coins
- Search problems for two irregular coins with incomplete feedback: The underweight model
- An improved algorithm for quantitative group testing
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
- A new competitive algorithm for the counterfeit coin problem
- On the conjecture at two counterfeit coins
- Optimal detection of two counterfeit coins with two-arms balance.
- Optimal detection of a counterfeit coin with multi-arms balances
- 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
- The Counterfeit Coin Problem Revisited
- Modifications of Competitive Group Testing
- Optimal Detection of Two Complementary Defectives
- Coin-Weighing Problems
