The general counterfeit coin problem
From MaRDI portal
Publication:1910513
DOI10.1016/0012-365X(94)00232-8zbMath0838.05004MaRDI QIDQ1910513
Norbert Hungerbühler, Lorenz Halbeisen
Publication date: 24 March 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Quantum counterfeit coin problems, Tightening the bounds on the Baron's omni-sequence, 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, Searching for a counterfeit coin with \(b\)-balance
Cites Work