论文信息 - The complexity of determinacy problem on group testing

The complexity of determinacy problem on group testing

The complexity of group testing is a long-standing open problem. Recently, Du and Ko studied some related problems which can explain the hardness of group testing undirectly. One of such problems is called the determinacy problem on which they left open questions for some models. In this paper, we answer all of them.

Ding-Zhu Du | Feng Yang | D. Du | Feng Yang

[1] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[2] A. Kolen. Combinatorial optimization algorithm and complexity: Prentice-Hall, Englewood Cliffs, 1982, 496 pages, $49.50 , 1983 .

[3] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[4] Ding-Zhu Du,et al. Hypergeometric and Generalized Hypergeometric Group Testing , 1981 .

[5] R. Dorfman. The Detection of Defective Members of Large Populations , 1943 .

[6] D. Du,et al. Some completeness results on decision trees and group testing , 1987 .