Abstract
A method is illustrated for the selection of a minimal cost subset of prime implicants of a Boolean function. The selection problem is represented by a table (P-table), which is an extension of a prime implicant table. A technique for P-table reduction is presented, which allows tabular simplifications for cyclic prime implicant tables also.

This publication has 5 references indexed in Scilit: