Complexity of DNF and Isomorphism of Monotone Formulas
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DNF related problems, the complexity of the monotone case strongly differs from the arbitrary case. We show that it is DP-complete to check whether a monomial is a prime implicant for an arbitrary formula, but checking prime implicants for monotone formulas is in L. We show PP-completeness of checking whether the minimum size of a DNF for a monotone formula is at most k. For k in unary, we show the complexity of the problem to drop to coNP. In [Uma01] a similar problem for arbitrary formulas was shown to be \(\Sigma^P_2\)-complete. We show that calculating the minimal DNF for a monotone formula is possible in output-polynomial time if and only if P = NP. Finally, we disprove a conjecture from [Rei03] by showing that checking whether two formulas are isomorphic has the same complexity for arbitrary formulas as for monotone formulas.
KeywordsPolynomial Time Conjunctive Normal Form Boolean Formula Disjunctive Normal Form Satisfying Assignment
Unable to display preview. Download preview PDF.
- [Czo99]Czort, S.L.A.: The complexity of minimizing Disjunctive Normal Form formulas. Technical Report IR-130, Dept. of Computer Science, University of Aarhus (January 1999)Google Scholar
- [Mas79]Masek, W.J.: Some NP-complete set covering problems. Unpublished manuscript (1979)Google Scholar
- [Pap97]Papadimitriou, C.H.: NP-completeness: a retrospective. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 2–6. Springer, Heidelberg (1997)Google Scholar