Synthesis of Networks with a Minimum Number of Negative Gates
Toshihide Ibaraki, Saburo Muroga · IEEE Transactions on Computers · 1971
In this paper we develop an algorithm to design a switching network using only gates which represent negative functions. The number of gates in the network is minimized under the conditions that 1) the network consists of two levels, and 2) no fan-in restriction on each gate is imposed.