The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1970 vol.19)
pp: 858
J.D. Bargainer , University of Houston
ABSTRACT
The problem treated in this paper is that of realizing a Boolean function which is not linearly separable with a network of threshold gates. This problem has been treated by the tree method of Coates and Lewis [1], the geometric methods of Winder [5], and the algebraic methods of Hopcroft and Mattson [3] and Stabler [4] among others. In the above methods, the techniques become computationally impractical for a large number of variables and functions requiring several threshold gates. The method presented in this paper suffers from the same limitations, as well as from the fact that it is based entirely on necessary but not sufficient conditions for linear separability.
INDEX TERMS
null
CITATION
J.D. Bargainer, "R70-34 Unateness Test of a Boolean Function and Two General Synthesis Methods Using Threshold Logic", IEEE Transactions on Computers, vol.19, no. 9, pp. 858, September 1970, doi:10.1109/T-C.1970.223062
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool