Coin-Weighing Problems
From MaRDI portal
Publication:4873033
DOI10.2307/2975353zbMath0866.05009OpenAlexW2008786622WikidataQ56432151 ScholiaQ56432151MaRDI QIDQ4873033
Richard K. Guy, Richard J. Nowakowski
Publication date: 16 April 1996
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2975353
Related Items (11)
Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs ⋮ Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem ⋮ Optimal detection of two counterfeit coins with two-arms balance. ⋮ Privacy and counterfeit coins ⋮ Quantum counterfeit coin problems ⋮ Minimal average cost of searching for a counterfeit coin: restricted model ⋮ Optimal search procedure on coin-weighing problem ⋮ On the strong metric dimension of tetrahedral diamond lattice ⋮ 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
This page was built for publication: Coin-Weighing Problems
