BOUNDS FOR NONADAPTIVE GROUP TESTS TO ESTIMATE THE AMOUNT OF DEFECTIVES (Q2905282): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Two-Stage Algorithms for Group Testing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Results for Competitive Group Testing / rank
 
Normal rank

Latest revision as of 15:07, 5 July 2024

scientific article
Language Label Description Also known as
English
BOUNDS FOR NONADAPTIVE GROUP TESTS TO ESTIMATE THE AMOUNT OF DEFECTIVES
scientific article

    Statements

    BOUNDS FOR NONADAPTIVE GROUP TESTS TO ESTIMATE THE AMOUNT OF DEFECTIVES (English)
    0 references
    0 references
    0 references
    27 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    group testing
    0 references
    combinatorial search
    0 references
    learning by queries
    0 references
    nonadaptive strategy
    0 references
    competitive ratio
    0 references
    randomization
    0 references
    linear program
    0 references
    lower bound
    0 references