Computational Complexity of Partitioned List Algorithms
IEEE Transactions on Computers
Computer Experience on Partitioned List Algorithms
IEEE Transactions on Computers
Irredundant disjunctive and conjunctive forms of a Boolean function
IBM Journal of Research and Development
A Simple Technique to Improve the Pi-Algorithm for Prime Implicant Determination
IEEE Transactions on Computers
Computer Experience on Partitioned List Algorithms
IEEE Transactions on Computers
MINI: a heuristic approach for logic minimization
IBM Journal of Research and Development
Generating test examples for heuristic Boolean minimization
IBM Journal of Research and Development
CirCUs: a hybrid satisfiability solver
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Delay optimization using SOP balancing
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 14.99 |
A common recursive formulation is presented for determining: 1) all the prime implicants, and 2) an irredundant normal form of any completely or incompletely specified Boolean function given in canonical form. Formulas for specific operators Pi and lrr2 solving these problems are given and recursive partitioned list algorithms are described for them. The solution of both of the above problems through recursive partitioned list algorithms is significantly faster than through the corresponding nonrecursive algorithms.