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
Acta Cybernetica
A theory of diagnosis from first principles
Artificial Intelligence
Dualization of regular Boolean functions
Discrete Applied Mathematics
On generating all maximal independent sets
Information Processing Letters
An O(nm)-time algorithm for computing the dual of a regular Boolean function
Discrete Applied Mathematics - Special volume: viewpoints on optimization
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
Colouring, stable sets and perfect graphs
Handbook of combinatorics (vol. 1)
ACM SIGACT News
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
SIAM Journal on Computing
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
The Maximum Latency and Identification of Positive Boolean Functions
SIAM Journal on Computing
Generating all maximal independent sets of bounded-degree hypergraphs
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
A fast and simple algorithm for identifying 2-monotonic positive Boolean functions
Journal of Algorithms
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
SIAM Journal on Computing
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
NP-Completeness: A Retrospective
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On Horn Envelopes and Hypergraph Transversals
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
Incremental recompilation of knowledge
Journal of Artificial Intelligence Research
Monotone boolean dualization is in co-NP[log2n]
Information Processing Letters
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
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
On computing all abductive explanations
Eighteenth national conference on Artificial intelligence
Pareto-optimal patterns in logical analysis of data
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Tractable database design through bounded treewidth
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters
Theoretical Computer Science
Self-duality of bounded monotone boolean functions and related problems
Discrete Applied Mathematics
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
Pareto-optimal patterns in logical analysis of data
Discrete Applied Mathematics
Bounded fixed-parameter tractability and log2n nondeterministic bits
Journal of Computer and System Sciences
On the complexity of enumerating pseudo-intents
Discrete Applied Mathematics
A new algorithm for the hypergraph transversal problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Transaction databases, frequent itemsets, and their condensed representations
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
Computing Implications with Negation from a Formal Context
Fundamenta Informaticae - Concept Lattices and Their Applications
| Hi-index | 0.00 |
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent open problem in NP-completeness. We present a number of new polynomial time resp. output-polynomial time results for significant cases, which largely advance the tractability frontier and improve on previous results. Furthermore, we show that duality of two monotone CNFs can be disproved with limited nondeterminism (more precisely, in polynomial time with $O(\log^2 n)$ suitably guessed bits). This result sheds new light on the complexity of this important problem.