On generating all maximal independent sets
Information Processing Letters
Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
Complexity of identification and dualization of positive Boolean functions
Information and Computation
ACM SIGACT News
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
Data mining, hypergraph transversals, and machine learning (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Generating all maximal models of a Boolean expression
Information Processing Letters
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
NP-Completeness: A Retrospective
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On the fixed-parameter tractability of the equivalence test of monotone normal forms
Information Processing Letters
On computing all abductive explanations from a propositional Horn theory
Journal of the ACM (JACM)
Complexity of DNF minimization and isomorphism testing for monotone formulas
Information and Computation
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
On the complexity of monotone dualization and generating minimal hypergraph transversals
Discrete Applied Mathematics
Lower bounds for three algorithms for transversal hypergraph generation
Discrete Applied Mathematics
On the fractional chromatic number of monotone self-dual Boolean functions
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Some fixed-parameter tractable classes of hypergraph duality and related problems
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
On the complexity of enumerating pseudo-intents
Discrete Applied Mathematics
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.89 |
In 1996, Fredman and Khachiyan [J. Algorithms 21 (1996) 618-628] presented a remarkable algorithm for the problem of checking the duality of a pair of monotone Boolean expressions in disjunctive normal form. Their algorithm runs in no(log n) time, thus giving evidence that the problem lies in an intermediate class between P and co-NP. In this paper we show that a modified version of their algorithm requires deterministic polynomial time plus O(log2 n) nondeterministic guesses, thus placing the problem in the class co-NP[log2 n]. Our nondeterministic version has also the advantage of having a simpler analysis than the deterministic one.