Non-adaptive learning of a hidden hypergraph (Q1704557): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Queries and concept learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a Hidden Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a Hidden Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Exact Learning Monotone DNF from Membership Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174038 / 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: Algorithmic construction of sets for <i>k</i> -restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Learning from Membership Queries: Some Techniques, Results and New Directions / 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: Testers and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Optimal Cover-Free Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asking questions to minimize errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of hidden graphs and threshold group testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a hidden graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on nonadaptive group testing algorithms through the angle of decoding / 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: Q5395177 / 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: Nonrandom binary superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms / 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: 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: On a bound of cover-free families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning and Verifying Graphs Using Queries with a Focus on Edge Counting / 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: Q4487082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets pooling designs / rank
 
Normal rank

Latest revision as of 08:02, 15 July 2024

scientific article
Language Label Description Also known as
English
Non-adaptive learning of a hidden hypergraph
scientific article

    Statements

    Non-adaptive learning of a hidden hypergraph (English)
    0 references
    0 references
    0 references
    0 references
    12 March 2018
    0 references
    0 references
    hypergraphs
    0 references
    monotone DNF
    0 references
    cover-free family
    0 references
    perfect hash family
    0 references
    non-adaptive learning
    0 references
    group testing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references