A fast computer algorithm for the generation of disjoint cubes for completely and incompletely specified Boolean functions
B.J. Falkowski, Ingo Schäfer, Marek A. Perkowski · 2002
An algorithm is presented that generates an array of disjoint cubes describing completely and incompletely specified Boolean functions. A peculiar feature of the algorithm, which speeds up its execution, is that in comparison to known algorithms it minimizes the number of usages of cube calculus operations. Pointer structures and array allocations of the C language are effectively used in its implementation.>