scientific article; zbMATH DE number 25604

MaRDI QIDQ3984071zbMATH OpenFDO

Authors Du Ding-Zhu

Publication date 27 June 1992

zbMATH Keywords

NP-completenessgroup testing

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• The complexity of determinacy problem on group testing
• scientific article; zbMATH DE number 4213456
• Some Completeness Results on Decision Trees and Group Testing
• A Fundamental Monotonicity in Group Testing
• On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges

Cited in

(3)

• Some Completeness Results on Decision Trees and Group Testing
• An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
• The complexity of determinacy problem on group testing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984071)