A 23 log 3-competitive algorithm for the counterfeit coin problem

DOI10.1007/BFB0030863MaRDI QIDQ6085738zbMATH OpenOpenAlexFDO

Authors Dean F. Kelley, Peng-Jun Wan, Qifan Yang

Publication date 12 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0030863

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Combinatorics in computer science (68R05) Analysis of algorithms (68W40)

Recommendations

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

Cites work

• A new competitive algorithm for the counterfeit coin problem
• scientific article; zbMATH DE number 895369 (Why is no real title available?)

Cited in

(1)

• A \(\frac{3}{2}\log 3\)-competitive algorithm for the counterfeit coin problem

This page was built for publication: A 23 log 3-competitive algorithm for the counterfeit coin problem

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