Almost Optimal Cover-Free Families (Q5283363): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963540524 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1507.07368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On r-Simple k-Path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-adaptive Learning of a Hidden Hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a hidden graph using \(O(\log n)\)queries per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collusion-secure fingerprinting for digital data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testers and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Constructions of Some $$d$$-Restriction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-adaptive complex group testing with multiple positive sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3469037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the rate of disjunctive codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-cover-free families / 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: Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrandom binary superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient construction of a small hitting set for combinatorial rectangles in high dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions of separating hash families from algebraic curves over finite fields / 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: Q5457049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Nonadaptive Combinatorial Group Testing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4487082 / 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

Latest revision as of 04:41, 14 July 2024

scientific article; zbMATH DE number 6751058
Language Label Description Also known as
English
Almost Optimal Cover-Free Families
scientific article; zbMATH DE number 6751058

    Statements

    Almost Optimal Cover-Free Families (English)
    0 references
    0 references
    0 references
    21 July 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references