返回Google圖書搜尋

A Competitive Algorithm for the Counterfeit Coin Problem

出版	DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, 1991
URL	http://books.google.com.hk/books?id=nVuIHAAACAAJ&hl=&source=gbs_api

註釋Abstract: "The classical counterfeit coin problem asks for the minimum number of weighings on a beam balance to find the counterfeit coin among a set of n coins. The classical problem has been extended to more than one counterfeit coin, but the knowledge of the number of counterfeit coin [sic] is always assumed. In this paper we assume no such knowledge and propose an algorithm with uniform good performance."