# On the complexity of monotone dualization and generating minimal hypergraph transversals

```@article{Elbassioni2008OnTC,
title={On the complexity of monotone dualization and generating minimal hypergraph transversals},
author={Khaled M. Elbassioni},
journal={Discret. Appl. Math.},
year={2008},
volume={156},
pages={2109-2123}
}```
In 1994 Fredman and Khachiyan established the remarkable result that the duality of a pair of monotone Boolean functions, in disjunctive normal forms, can be tested in quasi-polynomial time, thus putting the problem, most likely, somewhere between polynomiality and coNP-completeness. We strengthen this result by showing that the duality testing problem can in fact be solved in polylogarithmic time using a quasi-polynomial number of processors (in the PRAM model). While our decomposition… Expand
Polynomially solvable cases of hypergraph transversal and related problems
• I. Rauf
• Computer Science, Mathematics
• 2011
The hypergraph transversal problem is shown to be solvable in output polynomial time for a number of hypergraph classes, and tight sublinear upper bounds on the readability of a monotone Boolean function given in CNF (or DNF) form are given, parameterized by the number of terms in the CNF and the maximum number of variables in the intersection of any constant number of Terms. Expand
Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
It is shown that none of the new algorithms improving the sequential method is output-polynomial, by proving lower bounds for all three algorithms. Expand
Speeding up Dualization in the Fredman-Khachiyan Algorithm B
• Computer Science
• SEA
• 2018
This work investigates the use of the FK-B algorithm for the computation of the dual of a monotone Boolean function, and presents practical improvements to its performance, and describes a simple memoization technique that avoids the solution of multiple identical subproblems. Expand
Resolution based algorithms for the transversal hypergraph generation problem
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2020
A novel algorithm for the problem of hypergraph duality, given a hypergraph H, is given based on the notion of subtransversal, and it is shown how to compute the residual dual of H given a subset E of its minimal transversals. Expand
Achieving new upper bounds for the hypergraph duality problem through logic
• Mathematics, Computer Science
• CSL-LICS
• 2014
This paper develops a new nondeterministic algorithm for DUAL that requires to guess O(log2 n) bits and forms its deterministic part in FO(COUNT), i.e., first order logic augmented by counting quantifiers. Expand
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
• G. Gottlob
• Mathematics, Computer Science
• PODS '13
• 2013
It is shown that duality testing for hypergraphs, and thus for monotone DNFs, is feasible in DSPACE(log2 n), i.e., in quadratic logspace, and that whenever, for a Boolean-valued relation, a number of maximal frequent itemsets and anumber of minimal infrequent itemsets are known, then it can be decided in quadRatic log space whether there exist additional frequent or infrequent itemets. Expand
Algorithmic and Computational Complexity Issues of MONET
Several restricted classes of Monet are shown to be solvable in logarithmic space, which improves previously known polynomial time bounds and shows Monet to be in the complexity class of fixed-parameter tractable problems with respect to several parameters. Expand
Lower bounds for three algorithms for transversal hypergraph generation
It is shown that none of the three new algorithms improving the sequential method for hypergraph generation are output-polynomial, by proving lower bounds for all three algorithms. Expand
Non-monotone Dualization via Monotone Dualization
• Computer Science, Mathematics
• ILP
• 2012
The non-monotone dualization (NMD) is one of the most essential tasks required for finding hypotheses in various ILP settings, like learning from entailment [1, 2] and learning from interpretationsExpand
Enumerating Minimal Transversals of Geometric Hypergraphs
• Mathematics, Computer Science
• CCCG
• 2011
This work shows that, when the hypergraph admits a balanced subdivision, then a recursive decomposition can be used to obtain eciently all minimal hitting sets of the hyper graph, and applies this decomposition framework to get incremental polynomial-time algorithms for minimum hitting sets and minimal set covers for a number of hypergraphs induced by a set of points and aSet of geometric objects. Expand

#### References

SHOWING 1-10 OF 58 REFERENCES
New Results on Monotone Dualization and Generating Hypergraph Transversals
• Mathematics, Computer Science
• SIAM J. Comput.
• 2003
It is shown that duality of two monotone CNFs can be disproved with limited nondeterminism and feasible in polynomial time with O(log2 n/\log log n) suitably guessed bits. Expand
Exact Transversal Hypergraphs and Application to Boolean µ-Functions
• Thomas Eiter
• Computer Science, Mathematics
• J. Symb. Comput.
• 1994
It is shown that hypergraphs are recognizable in polynomial time and that their minimal transversals as well as their maximal independent sets can be generated in lexicographic order withPolynomial delay between subsequent outputs, which is impossible in the general case unless P= NP. Expand
Computational aspects of monotone dualization: A brief survey
• Computer Science, Mathematics
• Discret. Appl. Math.
• 2008
This paper focuses on the famous paper by Fredman and Khachiyan, which showed that the dualization of monotone disjunctive normal forms is solvable in quasi-polynomial time (and thus most likely not co-NP-hard), as well as on follow-up works. Expand
Monotone Boolean dualization is in co-NP[log2n]
• Mathematics, Computer Science
• Inf. Process. Lett.
• 2003
A modified version of Fredman and Khachiyan's algorithm requires deterministic polynomial time plus O( log2 n) nondeterministic guesses, thus placing the problem in the class co-NP[log2 n]. Expand
Self-Duality of Bounded Monotone Boolean Functions and Related Problems
• Mathematics, Computer Science
• ALT
• 2000
The equivalence between the problem of determining self-duality of a boolean function in DNF and a special type of satisfiability problem called NAESPI is shown and it is shown that c-bounded NAesPI can be solved in polynomial time when c is some constant. Expand
Transversal Hypergraphs and Families of Polyhedral Cones
We discuss the complexity of generating certain geometric configurations related to the classical theorems of Caratheodory and Helly. Given a set K of rational cones in n dimensions and a rationalExpand
Dual subimplicants of positive Boolean functions
• Mathematics
• 1998
Given a positive Boolean function fand a subset δ of its variables, we give a combinatorial condition characterizing the existence of a prime implicant Dˆof the Boolean dual f d of f having theExpand
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
• Computer Science, Mathematics
• SIAM J. Comput.
• 2002
The results imply, in particular, that the problem of incrementally generating all minimal integer solutions to a monotone system of linear inequalities can be done in quasi-polynomial time. Expand
A global parallel algorithm for the hypergraph transversal problem
• Computer Science, Mathematics
• Inf. Process. Lett.
• 2007
A new decomposition technique is given for solving the problem of finding all minimal transversals of a hypergraph H@?2^V, given by an explicit list of its hyperedges with the following advantages: global parallelism, and new results on the complexity of generating minimalTransversals for new classes of hypergraphs. Expand
On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
The first non-trivial upper-bounds on the complexity of the (generalized) multiplication method are presented, showing that if the grouping of the clauses is done in an output-independent way, then multiplication can be performed in sub-exponential time (n|ψ|) O( √ |Φ|) | Φ| O(log n) . Expand