Pages that link to "Item:Q1961324"
From MaRDI portal
The following pages link to Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries (Q1961324):
Displaying 25 items.
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems (Q669949) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Version spaces and the consistency problem (Q814597) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Self-duality of bounded monotone Boolean functions and related problems (Q944707) (← links)
- On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
- Almost all monotone Boolean functions are polynomially learnable using membership queries (Q1603482) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (Q1861581) (← links)
- Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
- Learning a subclass of \(k\)-quasi-Horn formulas with membership queries (Q1944948) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- On Exact Learning Monotone DNF from Membership Queries (Q2938727) (← links)
- The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization (Q5449540) (← links)
