Sciweavers

IPL
2007

On the fixed-parameter tractability of the equivalence test of monotone normal forms

13 years 10 months ago
On the fixed-parameter tractability of the equivalence test of monotone normal forms
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, 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. Key words: Analysis of algorithms, Computational complexity, Equivalence test, Fixed-parameter tractability, Monotone normal forms
Matthias Hagen
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where IPL
Authors Matthias Hagen
Comments (0)