Abstract
It is shown that any Boolean expression in disjunctive normal form having k conjuncts, can have at most 2k prime implicants. However, there exist such expressions that have 2k2 prime implicants. It is also shown that any Boolean expression on n distinct propositional variables can have at most O(3nn) prime implicants, and that there exist expressions with ω(3nn prime implicants.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have