Learning a hidden uniform hypergraph (Q683922): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3994535 / 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: 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: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a hidden graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive algorithm for group testing for complexes / 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: Sets pooling designs / rank
 
Normal rank

Latest revision as of 02:20, 15 July 2024

scientific article
Language Label Description Also known as
English
Learning a hidden uniform hypergraph
scientific article

    Statements

    Learning a hidden uniform hypergraph (English)
    0 references
    0 references
    0 references
    0 references
    9 February 2018
    0 references
    graph learning
    0 references
    group testing
    0 references
    complex model
    0 references
    adaptive algorithm
    0 references

    Identifiers

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