An effective computer algorithm for the calculation of disjoint cube representation of Boolean functions

An efficient computer algorithm is shown to calculate an optimal cube array specification of Boolean functions. Since the number of disjoint cubes is much smaller than the number of minterms, the memory requirements are significantly reduced. The results of a comparison of the execution of the program with ESPRESSO for the MCNC benchmark functions are given.<
>