Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, M., Thierauf, T.: The formula isomorphism problem. SIAM Journal on Computing 30(3), 990–1009 (2000)
Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L.: An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension. Parallel Processing Letters 10(4), 253–266 (2000)
Borchert, B., Ranjan, D., Stephan, F.: On the computational complexity of some classical equivalence relations on Boolean functions. Theory of Computing Systems 31(6), 679–693 (1998)
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)
Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing 24(6), 1278–1304 (1995)
Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone Disjunctive Normal Forms. Journal of Algorithms 21, 618–628 (1996)
Masek, W.J.: Some NP-complete set covering problems. Unpublished manuscript (1979)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
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)
Papadimitriou, C.H., Yannakakis, M.: The complexity of facets (and some facets of complexity). Journal of Computer and System Sciences 28, 224–259 (1984)
Reith, S.: On the complexity of some equivalence problems for propositional calculi. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 632–641. Springer, Heidelberg (2003)
Umans, C.: The minimum equivalent DNF problem and shortest implicants. Journal of Computer and System Sciences 63(4), 597–611 (2001)
Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing 8(3), 410–421 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldsmith, J., Hagen, M., Mundhenk, M. (2005). Complexity of DNF and Isomorphism of Monotone Formulas. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_36
Download citation
DOI: https://doi.org/10.1007/11549345_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28702-5
Online ISBN: 978-3-540-31867-5
eBook Packages: Computer ScienceComputer Science (R0)