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 3mterms; but there are functions of n variables which require at least 2n/n log23 terms for sufficiently large n.
No takes yet. Share an insight, caveat, or question.
Even et al. (1967) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: