It is well known that if a Boolean function is expressed in sum of pro
ducts, each function can be implemented with one level of AND gates fo
llowed by an OR gate. We will prove that if each desired output of a b
inary function is expressed in sum of products, each desired output ca
n be implemented with one layer of perceptron nodes followed by a perc
eptron node. (C) 1998 Elsevier Science B.V. All rights reserved.