2009/06/03 by An-Ping Li, Li, An-Ping, Hagen von Eitzen +1
Engineering · Mathematics · #05A05 #68E05 #Combinatorics (math.CO) #Extraction and Separation Processes #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #math.CO #msc:05A05 #msc:68E05
paper · pdf · doi:10.48550/arxiv.0906.0693
there is a new lower bound presented.
openalex publication_date 2009/06/03 · arxiv created 2010/04/25 · arxiv updated 2010/04/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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