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

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 449-458

  Chattopadhyay, Arkadev ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; CONTROL THEORY; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; MILITARY DATA PROCESSING;

(MIN ,MAX ,+) FUNCTIONS; BASE LAYERS; COMMUNICATION COMPLEXITIES; LOWER BOUNDS; POLYNOMIAL DEGREES; SECOND LAYER; SYMMETRIC FUNCTIONS;

BOOLEAN FUNCTIONS;

EID: 46749156950     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389515     Document Type: Conference Paper

References (26)

1. E. Allender. A note on the power of threshold circuits. In FOCS, pages 580-584, 1989.
2. m. In IEEE Conf. on Computational Complexity, pages 184-187, 2001.
3. J. Aspnes, R. Beigel, M. Furst, and S. Rudich. The expressive power of voting polynomials. Combinatorica, 14(2): 1-14, 1994.
4. L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. J. Computer and System Sciences., 45(2):204-232, 1992.
5. P. Beame, T. Pitassi, and N. Segerlind. Lower bounds for lovász-schrijver systems and beyond follow from multiparty communication complexity. In ICALP, pages 1176-1188, 2005.
6. R. Beigel and J. Tarui. On ACC. Computational Complexity, 4:350-356, 1994.
7. J. Bourgain. Estimates of certain exponential sums arising in complexity theory. C.R.Acad.Sci.Paris, Ser I 340(9):627-631, 2005.
8. J. Cai, F. Green, and T. Thierauf. On the correlation of symmetric functions. Mathematical systems theory, 29(3):245-258, 1996.
9. A. Chakrabarti. Lower bounds for multi-player pointer jumping. In IEEE Conf. Computational Complexity, pages 33-45, 2007.
10. A. Chandra, M. Furst, and R. Lipton. Multi-party protocols. In STOC, pages 94-99, 1983.
11. 3 norm. Technical report, 2005. arXiv.org:math/0503014.
12. F. Green. Exponential sums and circuits with a single threshold gate and mod-gates. Theory Comput. Systems, 32:453-466, 1999.
13. F. Green. The correlation between parity and quadratic polynomials mod 3. J.Comp.Syst.Sci, 69(1):28-44, 2004.
14. F. Green, A. Roy, and H. Straubing. Bounds on an exponential sum arising in boolean circuit complexity. C.R.Acad.Sci.Paris, Ser I 341:279-282, 2005.
15. A. Hajnal, W. Maass, P Pudlák, M. Szegedy, and G. Turán. Threshold circuits of bounded depth. J.Comput.Syst.Sci, 46(2): 129-154, 1993.
16. J. Håstad and M. Goldmann. On the power of small depth threshold circuits. Computational Complexity, 1:113-129, 1991.
17. O(n1/3). In STOC, pages 258-265, 2001.
18. M. Krause and P Pudlák. On the computational power of depth 2 circuits with threshold and modulo gates. In STOC, pages 48-57, 1994.
19. M. Krause and P Pudlák. Computing boolean functions by polynomials and threshold circuits. Computational Complexity, 7(4):346-370, 1998.
20. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
21. M. Minsky and S. Papert. Perceptrons:expanded edition. MIT Press, Cambridge, MA, USA, 1988.
22. R. O'Donnell and R. Servedio. Extremal properties of polynomial threshold functions. In IEEE Conf Computational Complexity, pages 3-12, 2003.
23. A. Samorodnitsky. Low degree tests at large distances. In STOC, 2007.
24. 0 from depth-2 Majority circuits. In STOC, pages 294-301, 2007.
25. E. Viola and A. Wigderson. Norms, XOR Lemmas, and lower bounds for GF(2) polynomials and multiparty protocols. In IEEE Conf. on Computational Complexity, pages 141-154, 2007.
26. A. Yao. On ACC and Threshold circuits. In FOCS, pages 619-627, 1990.