Dual subimplicants of positive Boolean functions
From MaRDI portal
Recommendations
- Complexity of identification and dualization of positive Boolean functions
- An O(nm)-time algorithm for computing the dual of a regular Boolean function
- Recognition and dualization of disguised bidual Horn functions.
- Computational aspects of monotone dualization: a brief survey
- Minimum self-dual decompositions of positive dual-minor Boolean functions
Cited in
(39)- On the fractional chromatic number of monotone self-dual Boolean functions
- Dualization of regular Boolean functions
- An O(nm)-time algorithm for computing the dual of a regular Boolean function
- Dualities in the class of extended Boolean functions
- The many facets of upper domination
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- On the generation of circuits and minimal forbidden sets
- Recognition and dualization of disguised bidual Horn functions.
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- The complexity of dependency detection and discovery in relational databases
- On the complexity of solution extension of optimization problems
- Extension and its price for the connected vertex cover problem
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- Complexity of identification and dualization of positive Boolean functions
- Invited talks
- Upper domination: complexity and approximation
- Enumeration of minimal dominating sets and variants
- Well-totally-dominated graphs
- Generating dual-bounded hypergraphs
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Enumerating minimal transversals of hypergraphs without small holes
- Discovery of the D-basis in binary tables based on hypergraph dualization
- Dualization of Boolean functions using ternary decision diagrams
- Minimal Roman dominating functions: extensions and enumeration
- Extension of some edge graph problems: standard, parameterized and approximation complexity
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- Minimal Roman dominating functions: extensions and enumeration
- Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
- Conformality of minimal transversals of maximal cliques
- Conformal hypergraphs: duality and implications for the upper clique transversal problem
- Enumerating minimal solution sets for metric graph problems
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- A global parallel algorithm for the hypergraph transversal problem
- Enumerating minimal dominating sets in chordal bipartite graphs
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
This page was built for publication: Dual subimplicants of positive Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4946700)
