A c-version of minimal boolean sum-of-product forms

摘要

A code in c for symbolic computation of all the minimal sums for a Boolean sum-of-product form has been developed by using the method of consensus taking. This code is capable of handling longer expressions with ease and is significantly faster than the one previously given in PROLOG.