Coin-Weighing Problems
From MaRDI portal
Publication:4873033
DOI10.2307/2975353zbMATH Open0866.05009OpenAlexW2008786622WikidataQ56432151 ScholiaQ56432151MaRDI QIDQ4873033FDOQ4873033
Authors: Richard K. Guy, R. 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
Recommendations
Cited In (13)
- Searching for a counterfeit coin with two unreliable weighings
- Quantum counterfeit coin problems
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
- Optimal detection of two counterfeit coins with two-arms balance.
- Minimal average cost of searching for a counterfeit coin: restricted model
- Optimal search procedure on coin-weighing problem
- Searching for two counterfeit coins with two-arms balance
- On the strong metric dimension of tetrahedral diamond lattice
- Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem
- Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
- Privacy and counterfeit coins
- Lower Bounds for Coin-Weighing Problems
- Biased coin puzzles
This page was built for publication: Coin-Weighing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4873033)