A 23 log 3-competitive algorithm for the counterfeit coin problem
From MaRDI portal
Publication:6085738
DOI10.1007/bfb0030863zbMath1527.68146OpenAlexW1644837885MaRDI QIDQ6085738
Dean F. Kelley, Qi-Fan Yang, Peng-Jun Wan
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
Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Enumerative combinatorics (05A99)
Cites Work
This page was built for publication: A 23 log 3-competitive algorithm for the counterfeit coin problem