The optimization of kEP-SOPs: Computational complexity, approximability and experiments
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Complexity of DNF minimization and isomorphism testing for monotone formulas
Information and Computation
Pattern minimization problems over recursive data types
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Journal of Computer and System Sciences
Exclusive and essential sets of implicates of Boolean functions
Discrete Applied Mathematics
Synthesizing view definitions from data
Proceedings of the 13th International Conference on Database Theory
A memory- and time-efficient on-chip TCAM minimizer for IP lookup
Proceedings of the Conference on Design, Automation and Test in Europe
The complexity of Boolean formula minimization
Journal of Computer and System Sciences
Computers in Biology and Medicine
Disjoint essential sets of implicates of a CQ Horn function
Annals of Mathematics and Artificial Intelligence
Minimization for generalized Boolean formulas
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
On minimal constraint networks
Artificial Intelligence
Boolean functions with long prime implicants
Information Processing Letters
A decomposition method for CNF minimality proofs
Theoretical Computer Science
Compact DSOP and Partial DSOP Forms
Theory of Computing Systems
SOP restructuring by exploiting don't cares
Microprocessors & Microsystems
Hi-index | 0.04 |
The complexity of two-level logic minimization is a topic of interest to both computer-aided design (CAD) specialists and computer science theoreticians. In the logic synthesis community, two-level logic minimization forms the foundation for more complex optimization procedures that have significant real-world impact. At the same time, the computational complexity of two-level logic minimization has posed challenges since the beginning of the field in the 1960s; indeed, some central questions have been resolved only within the last few years, and others remain open. This recent activity has classified some logic optimization problems of high practical relevance, such as finding the minimal sum-of-products (SOP) form and maximal term expansion and reduction. This paper surveys progress in the field with self-contained expositions of fundamental early results, an account of the recent advances, and some new classifications. It includes an introduction to the relevant concepts and terminology from computational complexity, as well a discussion of the major remaining open problems in the complexity of logic minimization