On Minimal Modulo 2 Sums of Products for Switching Functions

Abstract
The minimal number of terms required for representing any switching function as a modulo 2 sums of products is investigated, and an algorithm for obtaining economical realization is described. The main result is the following: every symmetric function of 2m+1 variables has a modulo 2 sum of products realization with at most 3m terms; but there are functions of n variables which require at least 2n/n log2 3 terms for sufficiently large n.

This publication has 2 references indexed in Scilit: