Pages that link to "Item:Q4946700"
From MaRDI portal
The following pages link to Dual subimplicants of positive Boolean functions (Q4946700):
Displayed 29 items.
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Discovery of the \(D\)-basis in binary tables based on hypergraph dualization (Q507518) (← links)
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (Q646712) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
- The many facets of upper domination (Q1704853) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- On the generation of circuits and minimal forbidden sets (Q1769072) (← links)
- Recognition and dualization of disguised bidual Horn functions. (Q1853017) (← 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)
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions (Q1961461) (← 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)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
- Invited talks (Q2692717) (← links)
- Upper Domination: Complexity and Approximation (Q2819508) (← links)
- Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
- Well-totally-dominated graphs (Q3390049) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
- Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6043174) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)