How to find many counterfeit coins?
From MaRDI portal
Publication:1076020
DOI10.1007/BF01788090zbMath0593.05002OpenAlexW2085860175MaRDI QIDQ1076020
Publication date: 1986
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788090
Related Items
Optimal detection of a counterfeit coin with multi-arms balances ⋮ Coins and cones ⋮ Finding defective coins ⋮ Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem ⋮ Minimum average-case queries of \(q+1\)-ary search game with small sets ⋮ Searching for counterfeit coins ⋮ Minimal average cost of searching for a counterfeit coin: restricted model ⋮ Optimal search procedure on coin-weighing problem ⋮ 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
Cites Work
This page was built for publication: How to find many counterfeit coins?