Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR07-050 | 25th May 2007 00:00

Discrepancy and the power of bottom fan-in in depth-three circuits


Authors: Arkadev Chattopadhyay
Publication: 9th June 2007 10:51
Downloads: 2176


We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty 'Number on the Forehead' model. Our method is based on the notion of voting polynomial degree of functions and extends the Degree-Discrepancy Lemma in the recent work of Sherstov (STOC'07). Using this technique,we provide the first example of a function in AC^0 that has n^{Omega(1)} randomized k-party communication complexity for any constant k. This proves that depth-three circuits consisting of a Majority gate at the output, gates computing arbitrary symmetric function at the second layer and arbitrary gates of bounded fan-in at the base layer cannot simulate the circuit class AC^0 in subexponential size. This is in contrast to the classical result of Yao and Beigel-Tarui that shows that such depth-three circuits having only Majority gates can simulate the class ACC^0 in quasipolynomial size if the bottom fan-in is increased to poly-logarithmic size.

In the second part, we simplify the arguments in the breakthrough work of Bourgain for obtaining exponentially small upper bounds on the correlation between the boolean function MOD_q and functions represented by polynomials of small degree over Z_m, whem m,q >= 2 are coprime integers. Our calculation also shows similarity with techniques used to estimate discrepancy of functions in the multiparty communication setting. This results in a slight improvement of earlier estimates. It is known that such estimates imply that circuits of type MAJ.MOD_m.AND_{eps.log n} cannot compute the MOD_q function in sub-exponential size. It remains a major open question to determine if such circuits can simulate ACC^0 in poly size when the bottom fan-in is increased to poly-logarithmic size.

ISSN 1433-8092 | Imprint