Circuit bottom fan-in and computational power

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 /spl epsiv/>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/sup 1-/spl epsiv//n). A consequence of these results is that the three input read-modes of alternating Turing machines proposed in the literature are all distinct.

[1]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[2]  Liming Cai,et al.  On the Structure of Parameterized Problems in NP , 1995, Inf. Comput..

[3]  Michael Sipser,et al.  Borel sets and circuit complexity , 1983, STOC.

[4]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[5]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[6]  Liming Cai,et al.  On the Amount of Nondeterminism and the Power of Verifying , 1997, SIAM J. Comput..

[7]  Ronald L. Graham,et al.  Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.

[8]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

[9]  Ravi B. Boppana,et al.  The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[10]  N. Immerman,et al.  On uniformity within NC 1 . , 1988 .

[11]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[12]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[13]  Andrew Chi-Chih Yao,et al.  Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.

[14]  Walter L. Ruzzo.  On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..

[15]  Samuel R. Buss,et al.  The Boolean formula value problem is in ALOGTIME , 1987, STOC.

[16]  Liming Cai,et al.  On fixed-parameter tractability and approximability of NP-hard optimization problems , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[17]  Jianer Chen.  Characterizing Parallel Hierarchies by Reducibilities , 1991, Inf. Process. Lett..

[18]  J. Håstad.  Computational limitations of small-depth circuits , 1987 .

[19]  Liming Cai,et al.  On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract) , 1993, MFCS.

[20]  Liming Cai,et al.  On Input Read-Modes of Alternating Turing Machines , 1995, Theor. Comput. Sci..