Title of article :
Searching for a counterfeit coin with two unreliable weighings Original Research Article
Author/Authors :
Wen-An Liu، نويسنده , , Qi Min Zhang، نويسنده , , Zan-Kan Nie، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2005
Abstract :
We provide a worst-case optimal procedure to identify one unknown heavy coin among N identically looking coins when a balance scale is used and at most two weighing results can be erroneous. The exact minimal number of weighings is determined. This solves completely the weighing problem of the case of two unreliable weighings.
Keywords :
Weighing problem , Worst-case optimal procedure , Information-theoretic bounds , Adaptive searching with unreliable information
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics