Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols

This paper presents a unified and simple treatment of basic questions concern- ing two computational models: multiparty communication complexity and polynomials over GF(2). The key is the use of (known) norms on Boolean functions, which capture their proximity to each of these models (and are closely related to property testers of this proximity). The main contributions are new XOR lemmas. We show that if a Boolean function has correlation at most e 1/2 with either of these models, then the correlation of the parity of its values on m independent instances drops exponentially with m. More specifically: • For polynomials over GF(2) of degree d, the correlation drops to exp m/4 d . No

[1]  Andrew Chi-Chih Yao,et al.  Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.

[2]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[3]  Michael E. Saks,et al.  Products and Help Bits in Decision Trees , 1999, SIAM J. Comput..

[4]  Fan Chung Graham,et al.  Communication Complexity and Quasi Randomness , 1993, SIAM J. Discret. Math..

[5]  Noga Alon,et al.  Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.

[6]  Emanuele Viola,et al.  Fooling Parity Tests with Parity Gates , 2004, APPROX-RANDOM.

[7]  Vince Grolmusz.  Separating the Communication Complexities of MOD m and MOD p Circuits , 1995, J. Comput. Syst. Sci..

[8]  Alexander Healy.  Randomness-Efficient Sampling Within NC1 , 2006, APPROX-RANDOM.

[9]  Emanuele Viola,et al.  Hardness amplification proofs require majority , 2008, SIAM J. Comput..

[10]  Noam Nisan,et al.  On Yao's XOR-Lemma , 1995, Electron. Colloquium Comput. Complex..

[11]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[12]  Johan Håstad,et al.  On the power of small-depth threshold circuits , 1991, computational complexity.

[13]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[14]  Arkadev Chattopadhyay.  An improved bound on correlation between polynomials over Z_m and MOD_q , 2006, Electron. Colloquium Comput. Complex..

[15]  U. Feige.  Error reduction by parallel repetition-the state of the art , 1995 .

[16]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[17]  L. Fortnow.  Complexity-Theoretic Aspects of Interactive Proof Systems , 1989 .

[18]  W. T. Gowers,et al.  A new proof of Szemerédi's theorem , 2001 .

[19]  Michael E. Saks,et al.  Products and help bits in decision trees , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[20]  Avi Wigderson,et al.  P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.

[21]  Testing low-degree polynomials over prime fields , 2009 .

[22]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[23]  Thomas P. Hayes,et al.  The Cost of the Missing Bit: Communication Complexity with Help , 1998, STOC '98.

[24]  Emanuele Viola,et al.  Pseudorandom bits for constant depth circuits with few arbitrary symmetric gates , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[25]  Leonid A. Levin,et al.  One-way functions and pseudorandom generators , 1985, STOC '85.

[26]  Satyanarayana V. Lokam,et al.  Communication Complexity of Simultaneous Messages , 2003, SIAM J. Comput..

[27]  Richard J. Lipton,et al.  Multi-party protocols , 1983, STOC.

[28]  Alex Samorodnitsky,et al.  Low-degree tests at large distances , 2006, STOC '07.

[29]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[30]  Noam Nisan,et al.  Hardness vs Randomness , 1994, J. Comput. Syst. Sci..

[31]  Ran Raz,et al.  Direct product results and the GCD problem, in old and new communication models , 1997, STOC '97.

[32]  Emanuele Viola,et al.  New correlation bounds for GF(2) polynomials using Gowers uniformity , 2006, Electron. Colloquium Comput. Complex..

[33]  Howard Straubing,et al.  Bounds on an exponential sum arising in Boolean circuit complexity , 2005 .

[34]  J. Bourgain.  Estimation of certain exponential sums arising in complexity theory , 2005 .

[35]  Christopher Umans,et al.  Simple extractors for all min-entropies and a new pseudorandom generator , 2005, JACM.

[36]  Noam Nisan,et al.  Pseudorandom bits for constant depth circuits , 1991, Comb..

[37]  Atri Rudra,et al.  Testing low-degree polynomials over prime fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[38]  Russell Impagliazzo,et al.  Hard-core distributions for somewhat hard problems , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[39]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[40]  W. T. Gowers,et al.  A New Proof of Szemerédi's Theorem for Arithmetic Progressions of Length Four , 1998 .

[41]  Noam Nisan,et al.  Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..

[42]  Ran Raz,et al.  The BNS-Chung criterion for multi-party communication complexity , 2000, computational complexity.

[43]  Luca Trevisan,et al.  Gowers uniformity, influence of variables, and PCPs , 2005, STOC '06.

[44]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

[45]  Avi Wigderson,et al.  Deterministic approximate counting of depth-2 circuits , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[46]  W. T. Gowers,et al.  A NEW PROOF OF SZEMER ´ EDI'S THEOREM , 2001 .

[47]  Ronen Shaltiel.  Towards proving strong direct product theorems , 2003, computational complexity.