The general counterfeit coin problem

DOI10.1016/0012-365X(94)00232-8MaRDI QIDQ1910513zbMATH OpenFDO

Authors Lorenz Halbeisen, Norbert Hungerbühler

Publication date 24 March 1996

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

strategiescounterfeit coin

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3898603
• Non-adaptive solutions to the general counterfeit coin problem
• scientific article; zbMATH DE number 999579
• Three counterfeit coins problem
• scientific article; zbMATH DE number 637398
• Four counterfeit coins problem
• On two counterfeit coins conjecture
• Some new results concerning three counterfeit coins problem
• scientific article; zbMATH DE number 1159036
• scientific article; zbMATH DE number 637330

Cites work

• Maximal Flow Through a Network

Cited in

(9)

• scientific article; zbMATH DE number 999579 (Why is no real title available?)
• A non-adaptive algorithm for the general counterfeit coin problem
• Quantum counterfeit coin problems
• How to find many counterfeit coins?
• Searching for a counterfeit coin with \(b\)-balance
• Quantum counterfeit coin problems
• Minimal average cost of searching for a counterfeit coin: restricted model
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910513)