scientific article; zbMATH DE number 895369

MaRDI QIDQ4883381zbMATH OpenFDO

Authors Xiaodong Hu, Frank K. Hwang

Publication date 13 October 1996

zbMATH Keywords

counterfeit coin problemminimum number of weighings

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial optimization (90C27)

Recommendations

• A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem
• A new competitive algorithm for the counterfeit coin problem
• A \(\frac{3}{2}\log 3\)-competitive algorithm for the counterfeit coin problem
• scientific article; zbMATH DE number 1868882
• Some new results concerning three counterfeit coins problem

Cited in

(16)

• A \(\frac{3}{2}\log 3\)-competitive algorithm for the counterfeit coin problem
• On Detecting Fake Coin Flip Sequences
• On the coin weighing problem with the presence of noise
• scientific article; zbMATH DE number 4047208 (Why is no real title available?)
• A non-adaptive algorithm for the general counterfeit coin problem
• Searching for a counterfeit coin with \(b\)-balance
• Quantum counterfeit coin problems
• scientific article; zbMATH DE number 2124491 (Why is no real title available?)
• Non-adaptive solutions to the general counterfeit coin problem
• Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
• A new competitive algorithm for the counterfeit coin problem
• Minimal average cost of searching for a counterfeit coin: restricted model
• Coins and cones
• A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem
• Privacy and counterfeit coins
• A 23 log 3-competitive algorithm for the counterfeit coin problem

This page was built for publication:

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