Research and Advances

Comment on Lawler’s multilevel Boolean minimization

Posted

Lawler [1] proposed a method of multilevel Boolean minimization which is a generalization of the conventional prime implicant approach for two-level minimization. In his article, he presented two lemmas (Lemmas 1 and 2) that are important in reducing the number of calculations involved in obtaining a solution. These lemmas can be extended to increase the efficiency even more. In particular, it is possible to lower the upper limit of the function interval for an incompletely specified function [2]. Later, the extended version of these lemmas will be shown to be of value in several aspects of the minimization procedure.

View this article in the ACM Digital Library.

Join the Discussion (0)

Become a Member or Sign In to Post a Comment

The Latest from CACM

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved

Communications of the ACM (CACM) is now a fully Open Access publication.

By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.

Learn More