The communication complexity of addition (2011)

by Emanuele Viola

Active Bibliography

Lower Bounds in . . . Learning Theory via Analytic Methods – Alexander Alexandrovich Sherstov - 2009
4 On the Power of Small-Depth Computation – Emanuele Viola - 2009
30 Circuit Complexity before the Dawn of the New Millennium – Eric Allender - 1997
Correlation bounds for polynomials over {0, 1} – Emanuele Viola - 2009
2 On the Power of Circuits with Gates of Low L_1 Norms – Vince Grolmusz - 1995
19 Bounded Independence Fools Halfspaces – Ilias Diakonikolas, Rocco A. Servedio, Parikshit Gopalan, Msr-silicon Valley, Ragesh Jaiswal, Emanuele Viola
7 Some Meet-in-the-Middle Circuit Lower Bounds – Kristoffer Arnsfelt Hansen, Kristo#er Arnsfelt Hansen, Peter Bro Miltersen - 2004
3 Approximation From Linear Spaces And Applications To Complexity – Meera Sitharam
25 Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates – Emanuele Viola - 2005
36 Separating AC 0 from depth-2 majority circuits – Alexander A. Sherstov - 2007
19 Communication lower bounds using dual polynomials – Alexander A. Sherstov
The NOF Multiparty Communication Complexity of Composed Functions ⋆ – Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen
3 Separating deterministic from nondeterministic NOF multiparty communication complexity – Paul Beame, Matei David, Toniann Pitassi - 2007
SIGACT News Complexity Theory Column 67 – Lane A. Hemaspaandra
7 Multiparty Communication Complexity and Threshold Circuit Size of AC 0 – Paul Beame, Dang-trinh Huynh-ngoc - 2008
3 Average-case complexity of detecting cliques – Benjamin Rossman - 2010
22 Computational Complexity Of Neural Networks: A Survey – Pekka Orponen - 1994
14 Neural Networks and Complexity Theory – Pekka Orponen - 1992
2 On the Complexity of Boolean Functions in Different Characteristics – Parikshit Gopalan, Shachar Lovett, Amir Shpilka - 2009