How to assign votes in a distributed system
Journal of the ACM (JACM)
Design by exmple: An application of Armstrong relations
Journal of Computer and System Sciences
On generating all maximal independent sets
Information Processing Letters
A fast parallel algorithm for computing all maximal cliques in a graph and the related problems
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Computational learning theory: an introduction
Computational learning theory: an introduction
Exact transversal hypergraphs and application to Boolean &mgr;-functions
Journal of Symbolic Computation
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
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 independent sets of bounded-degree hypergraphs
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
New Results on Monotone Dualization and Generating Hypergraph Transversals
SIAM Journal on Computing
Local and Global Methods in Data Mining: Basic Techniques and Open Problems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
NP-Completeness: A Retrospective
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
On Horn Envelopes and Hypergraph Transversals
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Evaluation of an Algorithm for the Transversal Hypergraph Problem
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices
Annals of Mathematics and Artificial Intelligence
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Mining border descriptions of emerging patterns from dataset pairs
Knowledge and Information Systems
On the Complexity of Some Enumeration Problems for Matroids
SIAM Journal on Discrete Mathematics
Enumerating spanning and connected subsets in graphs and matroids
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
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
A new algorithm for the hypergraph transversal problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
Given the prime conjunctive normal form (CNF) representation $\phi$ of a monotone Boolean function $f:\{0,1\}^n\to\{0,1\}$, the dualization problem calls for finding the corresponding prime disjunctive normal form representation $\psi$ of $f$. A very simple method works by multiplying out the clauses of $\phi$ from left to right in some order, simplifying whenever possible by using the absorption law. We show that for any monotone CNF $\phi$, left-to-right multiplication can be done in subexponential time, and for many interesting subclasses of monotone CNFs such as those with bounded size, bounded degree, bounded intersection, bounded conformality, and read-once formula, it can be done in polynomial or quasi-polynomial time.