Issue No.01 - January (1974 vol.23)
Optimal networks with thirty different types of restrictions are listed for the one-bit fuli adder. Optimality is derined as the minimization of the number of gates under different restrictions.
Implicit enumeration, integer programming, one-bit adder, optimal networks.
K.R. Hohulin, null Lih-Er Shiau, S. Muroga, "Optimal One-Bit Full Adders With Different Types of Gates", IEEE Transactions on Computers, vol.23, no. 1, pp. 63-70, January 1974, doi:10.1109/T-C.1974.223778