A non-adaptive algorithm for the general counterfeit coin problem

MaRDI QIDQ5455592zbMATH OpenFDO

Authors Xinpan Xiao

Publication date 4 April 2008

zbMATH Keywords

Dyson setsgeneral counterfeit coin problemnon-adaptive algorithms

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Searching and sorting (68P10) Combinatorial optimization (90C27)

Recommendations

• Non-adaptive solutions to the general counterfeit coin problem
• scientific article; zbMATH DE number 895369
• The general counterfeit coin problem
• A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem
• How to detect a counterfeit coin: Adaptive versus non-adaptive solutions

Cited in

(6)

• How to detect a counterfeit coin: Adaptive versus non-adaptive solutions
• A \(\frac{3}{2}\log 3\)-competitive algorithm for the counterfeit coin problem
• On Detecting Fake Coin Flip Sequences
• Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
• Non-adaptive solutions to the general counterfeit coin problem
• A 23 log 3-competitive algorithm for the counterfeit coin problem

This page was built for publication: A non-adaptive algorithm for the general counterfeit coin problem

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