Some Completeness Results on Decision Trees and Group Testing (Q3801062): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ker-I. Ko / rank
Normal rank
 
Property / author
 
Property / author: Ker-I. Ko / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996086711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of a Subset from Certain Combinatorial Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5731202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Which Is Complete in Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Sparse Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Binary Identification Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Versions of a Group Testing Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutoff points for roll call protocols in multiple access systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergeometric and Generalized Hypergeometric Group Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of queries necessary to identify a permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Information-Theoretic Bound is Good for Merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Combinatorial Problem in Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ford-Johnson Sorting Algorithm Is Not Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Binary Binomial Group Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5550257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Detection of Defective Members of Large Populations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for packet transmission rate in a random-multiple-access system / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Study of the Group Screening Method / rank
 
Normal rank

Latest revision as of 18:59, 18 June 2024

scientific article
Language Label Description Also known as
English
Some Completeness Results on Decision Trees and Group Testing
scientific article

    Statements

    Some Completeness Results on Decision Trees and Group Testing (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    0 references
    NP-completeness
    0 references
    {\#}P-completeness
    0 references
    group testing
    0 references
    decision tree
    0 references
    0 references