An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Learning a Hidden Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Packing and Covering in the Boolean Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal reconstruction of graphs under the additive model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrandom binary superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A group testing method for finding patterns in data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivial two-stage group testing for complexes using almost disjunct matrices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Key storage in secure networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized cover-free families. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new bounds for cover-free families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets pooling designs / rank
 
Normal rank

Revision as of 16:06, 27 June 2024

scientific article
Language Label Description Also known as
English
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
scientific article

    Statements

    An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (English)
    0 references
    0 references
    0 references
    0 references
    18 February 2008
    0 references
    group testing
    0 references
    pooling designs
    0 references
    superimposed codes
    0 references
    graph testing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references