Randomized group testing for mutually obscuring defectives
From MaRDI portal
Publication:293335
DOI10.1016/S0020-0190(98)00096-9zbMath1339.68311MaRDI QIDQ293335
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000969?np=y
computational complexitylearningcompetitivenessrandomized strategycounterfeit coin problemgroup testing problem
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Reliability, availability, maintenance, inspection in operations research (90B25) Randomized algorithms (68W20)
Related Items (11)
Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ On parallel attribute-efficient learning. ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ A class of asymptotically optimal group testing strategies to identify good items ⋮ Group Testing with Multiple Mutually-Obscuring Positives ⋮ On optimal randomized group testing with one defective item and a constrained number of positive responses ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC ⋮ Searching for a counterfeit coin with two unreliable weighings ⋮ A class of asymptotically optimal group screening strategies with limited item participation ⋮ Searching for two counterfeit coins with two-arms balance
Cites Work
This page was built for publication: Randomized group testing for mutually obscuring defectives
