The general counterfeit coin problem

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)

zbMATH Keywords

counterfeit coinstrategies

Mathematics Subject Classification ID

Searching and sorting (68P10) Permutations, words, matrices (05A05)

Related Items (5)

Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem ⋮ Quantum counterfeit coin problems ⋮ Minimal average cost of searching for a counterfeit coin: restricted model ⋮ Searching for a counterfeit coin with \(b\)-balance ⋮ Tightening the bounds on the Baron's omni-sequence

Cites Work

• Maximal Flow Through a Network

This page was built for publication: The general counterfeit coin problem