The complexity of determinacy problem on group testing

DOI10.1016/0166-218X(90)90095-TzbMath0699.68078OpenAlexW1978227002MaRDI QIDQ913514

Feng Yang, Ding-Zhu Du

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90095-t

zbMATH Keywords

NP-completenesspolynomial-time algorithmgroup testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• Some Completeness Results on Decision Trees and Group Testing
• Hypergeometric and Generalized Hypergeometric Group Testing

This page was built for publication: The complexity of determinacy problem on group testing