Error-tolerant non-adaptive learning of a hidden hypergraph
From MaRDI portal
Recommendations
Cites work
- A group testing method for finding patterns in data
- A survey on nonadaptive group testing algorithms through the angle of decoding
- Almost optimal cover-free families
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model
- ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES
- Generalized cover-free families.
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 5957397 (Why is no real title available?)
- scientific article; zbMATH DE number 1508646 (Why is no real title available?)
- Learning a hidden graph using \(O(\log n)\)queries per edge
- Learning regular sets from queries and counterexamples
- Linear Time Constructions of Some d-Restriction Problems
- Non-adaptive learning of a hidden hypergraph
- On Exact Learning Monotone DNF from Membership Queries
- Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
- Sets pooling designs
- Some new bounds for cover-free families
Cited in
(2)
This page was built for publication: Error-tolerant non-adaptive learning of a hidden hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005098)
