Issue No.01 - January (1970 vol.19)
A. S. Farber , IBM Watson Research Ctr., Yorktown Heights, N. Y.; Responsive Data Processing Corporation, Mt, Kisco, N. Y.
The use of published theorems on least times to perform arithmetic operations as aids in optimizing logic circuit designs is discussed. An illustrative example is presented involving the optimum maximum fan-in of circuits in a binary adder.
A. S. Farber, "Mathematical ``Lower Bounds'' and the Logic Circuit Designer", IEEE Transactions on Computers, vol.19, no. 1, pp. 80-81, January 1970, doi:10.1109/TC.1970.5008905