By Ronald C. de Vries
Communications of the ACM,
April 1970,
Vol. 13 No. 4, Pages 265-266
10.1145/362258.362301
Comments
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.
The full text of this article is premium content
No entries found
Log in to Read the Full Article
Need Access?
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.
