Coin-Weighing Problems

DOI10.2307/2975353MaRDI QIDQ4873033zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

coin-weighing problem

Mathematics Subject Classification ID

Enumerative combinatorics (05A99)

Recommendations

• The Biased Coin Problem
• Coins with Arbitrary Weights
• On the coin weighing problem with the presence of noise
• Lower Bounds for Coin-Weighing Problems
• The average complexity of a coin-weighing problem
• scientific article; zbMATH DE number 4184524
• A Coin-Tossing Problem and Some Related Combinatorics

Cited in

(13)

• Biased coin puzzles
• Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
• A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
• Optimal detection of two counterfeit coins with two-arms balance.
• On the strong metric dimension of tetrahedral diamond lattice
• Lower Bounds for Coin-Weighing Problems
• Minimal average cost of searching for a counterfeit coin: restricted model
• Quantum counterfeit coin problems
• Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem
• Optimal search procedure on coin-weighing problem
• Privacy and counterfeit coins
• Searching for two counterfeit coins with two-arms balance
• Searching for a counterfeit coin with two unreliable weighings

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)