Pages that link to "Item:Q2471071"

The following pages link to An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071):

Displaying 6 items.

• Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
• An adaptive algorithm for group testing for complexes (Q500957) (← links)
• Improved even order magic square construction algorithms and their applications in multi-user shared electronic accounts (Q896120) (← links)
• An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032) (← links)
• Nonadaptive algorithms for threshold group testing (Q1028130) (← links)
• A survey on nonadaptive group testing algorithms through the angle of decoding (Q2426664) (← links)