摘要
证明了对于所有整数n来说 ,三伪币问题的最小试验次数或等于信息论下界或超过信息论下界 1次。并对于无穷多个区间来说信息论下界均是可以达到的 。
It is proved that the minimum number of tests of three counterfeit coins problem is either equal to the information-theoretic bound, or exceeds it by 1. Moreover, the information-theoretic bounds are achievable for infinitely many intervals, thus Tosic results are greatly improved.
出处
《工程数学学报》
CSCD
北大核心
2004年第1期114-118,113,共6页
Chinese Journal of Engineering Mathematics
基金
ThisworkissupportedbytheNationalNaturalScienceFoundationofChina(6 9874 0 1 0 )
关键词
搜索
序列算法
信息论下界
伪币问题
search
sequential algorithm
information-theoretic bound
counterfeit coins problem
