Circuit Bottom Fan-in and Computational Power

• Authors: Liming Cai;Jianer Chen;Johan Hastad
• Venue: CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
• Year: 1997

We investigate the relationship between circuit bottom fan-in and circuit size when circuit depth is fixed. We show that in order to compute certain functions, a moderate reduction in circuit bottom fan-in will cause significant increase in circuit size. In particular, We prove that there are functions that are computable by circuits of linear size and depth k with bottom fan-in 2 but require exponential size for circuits of depth k with bottom fan-in 1. A general scheme is established to study the trade-off between circuit bottom fan-in and circuit size. Based on this scheme, we are able to prove, for example, that for any integer c, there are functions that are computable by circuits of linear size and depth k with bottom fan-in O(\log n) but require exponential size for circuits of depth k with bottom fan-in c, and that for any constant \epsilon 0, there are functions that are computable by circuits of linear size and depth k with bottom fan-in \log n but require superpolynomial size for circuits of depth k with bottom fan-in O(\log^{1-\epsilon} n). A consequence of these results is that the three input read-modes of alternating Turing machines proposed in the literature are all distinct. Keywords. computational complexity, circuit complexity, lower bound, alternating Turing machine