*ALGORITHMS, *MATHEMATICS, *ALGEBRA, *FOUNDATIONS of arithmetic, *COMPUTER programming, *SCIENCE
Abstract
An algorithm is proposed in this paper that finds exact exclusive-or sum-of-products of an arbitrary function, provided the number of product terms is less than eight. If the number of product terms in the minimal expression is more than seven, then the algorithm detects it and heuristically returns near-optimal expressions. The algorithm is time and space efficient even for functions with many input variables. [ABSTRACT FROM AUTHOR]