Dual subimplicants of positive Boolean functions
From MaRDI portal
Publication:4946700
DOI10.1080/10556789808805708zbMath0972.90048OpenAlexW2071532574WikidataQ59560805 ScholiaQ59560805MaRDI QIDQ4946700
Endre Boros, Peter L. Hammer, Vladimir A. Gurvich
Publication date: 16 November 2001
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789808805708
Related Items (29)
Dual-bounded generating problems: Weighted transversals of a hypergraph ⋮ A global parallel algorithm for the hypergraph transversal problem ⋮ On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs ⋮ Minimal Roman dominating functions: extensions and enumeration ⋮ Extension of some edge graph problems: standard, parameterized and approximation complexity ⋮ Enumerating minimal dominating sets in chordal bipartite graphs ⋮ Invited talks ⋮ The many facets of upper domination ⋮ Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions ⋮ On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions ⋮ A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs ⋮ Enumerating Minimal Transversals of Hypergraphs without Small Holes ⋮ An incremental polynomial time algorithm to enumerate all minimal edge dominating sets ⋮ On the complexity of monotone dualization and generating minimal hypergraph transversals ⋮ Discovery of the \(D\)-basis in binary tables based on hypergraph dualization ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ On the generation of circuits and minimal forbidden sets ⋮ Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry ⋮ Generating dual-bounded hypergraphs ⋮ On the fractional chromatic number of monotone self-dual Boolean functions ⋮ Efficiently enumerating hitting sets of hypergraphs arising in data profiling ⋮ Enumeration of Minimal Dominating Sets and Variants ⋮ Upper Domination: Complexity and Approximation ⋮ Well-totally-dominated graphs ⋮ 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 ⋮ Recognition and dualization of disguised bidual Horn functions. ⋮ Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
This page was built for publication: Dual subimplicants of positive Boolean functions
