Coin-Weighing Problems
From MaRDI portal
Recommendations
Cited in
(13)- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
- Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
- Optimal detection of two counterfeit coins with two-arms balance.
- Biased coin puzzles
- Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem
- 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
- Searching for a counterfeit coin with two unreliable weighings
- Searching for two counterfeit coins with two-arms balance
- Lower Bounds for Coin-Weighing Problems
- Privacy and counterfeit coins
- Quantum counterfeit coin problems
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)