Citation
Abstract
Angeles If C.(f:1, °° * fx) is the fan-out s combinational complexity of the functions fis fe, . of fan-in r, then it is shown that Cy (f15 a , fr) =Cs (fi, ue ft) - , fr with respect to straight-line algorithms (or combinational machines) d(r— d where N is the number of variables on which f,, - - ,f, depend and d = C, (I) where I is the identity function in one variable. Thus, a well-designed combinational machine or algorithm will not have a fan-out which is more than several times its fan-in.
Details
- Volume
- V
- Published
- October 15, 1971
- Pages
- 79–81
- File Size
- 205.3 KB