An improved lower bound on the counterfeit coins problem
An-Ping Li, Hagen von Eitzen
TL;DR
This paper presents an improved lower bound for the counterfeit coins problem when the number of false coins is unknown, advancing the theoretical understanding of the problem.
Contribution
It introduces a tighter lower bound for the problem, enhancing previous theoretical limits in coin-weighing strategies.
Findings
Established a new lower bound for the problem
Improved theoretical limits on coin-weighing strategies
Advances understanding of unknown false coin scenarios
Abstract
In this paper, we will give an improvement on the lower bound for the counterfeit coins problem in the case that the number of false coins is unknown in advance
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Extraction and Separation Processes · Graph theory and applications