The term "divide-and-conquer tree" also applies to the Sklansky adder. The minimum depth prefix network provided by Sklansky’s (1960) conditionally sum of addition logic for prefix addition will comes ...