Dual subimplicants of positive Boolean functions

DOI10.1080/10556789808805708zbMath0972.90048WikidataQ59560805 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

zbMATH Keywords

dualization; monotone Boolean functions; co-occurence graphs

Mathematics Subject Classification ID

90C09: Boolean programming

Related Items

Generating dual-bounded hypergraphs, Enumerating Minimal Transversals of Hypergraphs without Small Holes, Minimal Roman dominating functions: extensions and enumeration, An incremental polynomial time algorithm to enumerate all minimal edge dominating sets, Discovery of the \(D\)-basis in binary tables based on hypergraph dualization, Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions, 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, On the fractional chromatic number of monotone self-dual 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, Invited talks, Upper Domination: Complexity and Approximation, Enumeration of Minimal Dominating Sets and Variants, Well-totally-dominated graphs