Regular article
Polynomial-time algorithms for generation of prime implicants

https://doi.org/10.1016/0885-064X(92)90033-8Get rights and content
Under an Elsevier user license
open archive

Abstract

A notion of a neighborhood cube of a term of a Boolean function represented in the canonical disjunctive normal form is introduced. A relation between neighborhood cubes and prime implicants of a Boolean function is established. Various aspects of the problem of prime implicants generation are identified and neighborhood cube-based algorithms for their solution are developed. The correctness of algorithms is proven and their time complexity is analyzed. It is shown that all presented algorithms are polynomial in the number of minterms occurring in the canonical disjunctive normal form representation of a Boolean function. A summary of the known approaches to the solution of the problem of the generation of prime implicants is also included.

Cited by (0)