Optimal detection of two counterfeit coins with two-arms balance.

DOI10.1016/S0166-218X(03)00343-3zbMath1040.68030MaRDI QIDQ1427807

Wen-An Lui, Zan-Kan Nie

Publication date: 14 March 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmCoin-weighing problemCombinatorial search theoryInformation-theoretic boundsTwo counterfeit coins problemWorst-case sequential

Mathematics Subject Classification ID

Searching and sorting (68P10) Permutations, words, matrices (05A05)

Related Items (6)

Minimum average-case queries of \(q+1\)-ary search game with small sets ⋮ 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 ⋮ Searching for a counterfeit coin with two unreliable weighings ⋮ Searching for two counterfeit coins with two-arms balance

Cites Work

• Unnamed Item
• Unnamed Item
• Two counterfeit coins
• A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
• On the conjecture at two counterfeit coins
• Optimal detection of a counterfeit coin with multi-arms balances
• The average number of weighings to locate a counterfeit coin (Corresp.)
• On various versions of the defective coin problem
• An improved strategy for a counterfeit coin problem (Corresp.)
• The Counterfeit Coin Problem Revisited
• Coin-Weighing Problems

This page was built for publication: Optimal detection of two counterfeit coins with two-arms balance.