登入選單

返回Google圖書搜尋

Competitive Group Testing

DIMACS (GROUP)D. Z. DuF. K. Hwang

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

註釋

Abstract: "Let M[subscript t](n, d) denote the maximum number of group tests for a group testing algorithm t to identify d defectives from a set of n items. Let M(n, d) = min[subscript t] M[subscript t](n, d). An algorithm t is called a competitive algorithm if there exist constants c and a such that for all n> d> 0, M[subscript t](n, d) [