Abstract
We investigate the complexity and approximability of a basic optimization problem in the second level of the Polynomial Hierarchy, that of finding shortest implicants. We show that the DNF variant of this problem is complete for a complexity class in the second level of the hierarchy utilizing log2 n-limited nondeterminism. We obtain inapproximability results for the DNF and formula variants of the shortest implicant problem that show that trivial approximation algorithms are optimal for these problems, up to lower order terms. It is hoped that these results will be useful in studying the complexity and approximability of circuit minimization problems, which have close connections to implicant problems.
Supported in part by an NSF Graduate Research Fellowship and NSF grant CCR- 9626361
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Liming Cai and Jianer Chen. On the amount of nondeterminism and the power of verifying. SIAM Journal on Computing, 26(3):733–750, 1997.
Olivier Coudert. Two-level logic minimization: an overview. Integration, the VLSI journal, 17(2):97–140, 1994.
Srinivas Devadas, Adhijit Ghosh, and Kurt Keutzer. Logic Synthesis. McGraw-Hill, Inc., 1994.
Josep Diaz and Jacobo Toran. Classes of bounded nondeterminism. Mathematical Systems Theory, 23(1):21–32, 1990.
Edith Hemaspaandra and Gerd Wechsung. The minimization problem for boolean formulas. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS’ 97), pages 5755–5784, 1997.
E.J. McCluskey. Minimization of boolean functions. Bell Systems Technical Journal, 35(5):1417–1444, 1956.
Christos H. Papadimitriou and Mihalis Yannakakis. On limited nondeterminism and the complexity of the V-C dimension. Journal of Computer and System Sciences, 53(2):161–170, 1996.
W.V. Quine. The problem of simplifying truth functions. American Mathematics Monthly, 59(8):521–531, 1952.
L.J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3(1):1–22, 1976.
Tadeusz Strzemecki. Polynomial-time algorithms for generation of prime implicants. Journal of Complexity, 8(1):37–63, 1992.
Christopher Umans. The minimum equivalent DNF problem and shortest implicants. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS’ 98), pages 556–563, 1998.
Ingo Wegener. The complexity of Boolean functions. Teubner, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Umans, C. (1999). On the Complexity and Inapproximability of Shortest Implicant Problems. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_65
Download citation
DOI: https://doi.org/10.1007/3-540-48523-6_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66224-2
Online ISBN: 978-3-540-48523-0
eBook Packages: Springer Book Archive