How to assign votes in a distributed system
Journal of the ACM (JACM)
On generating all maximal independent sets
Information Processing Letters
On the complexity of inferring functional dependencies
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
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
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
Concrete Math
New Results on Monotone Dualization and Generating Hypergraph Transversals
SIAM Journal on Computing
Monotone boolean dualization is in co-NP[log2n]
Information Processing Letters
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
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
Some fixed-parameter tractable classes of hypergraph duality and related problems
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Hi-index | 0.89 |
We consider the problem Monet-given two monotone formulas @f in DNF and @j in CNF, decide whether they are equivalent. While Monet is probably not coNP-hard, it is a long standing open question whether it has a polynomial time algorithm and thus belongs to P. In this paper we examine the parameterized complexity of Monet. We show that Monet is in FPT by giving fixed-parameter algorithms for different parameters.