Separating NOF communication complexity classes RP and NP

We provide a non-explicit separation of the number-on-forehead communication complexity classes RP and NP when the number of players is up to δ · log n for any δ < 1. Recent lower bounds on SetDisjointness [10, 7] provide an explicit separation between these classes when the number of players is only up to o(log log n).

[1]  Toniann Pitassi,et al.  Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity , 2007, ICALP.

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

[3]  A. Chattopadhyay.  Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits , 2007, FOCS 2007.

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

[5]  Alexander A. Sherstov.  Separating AC0 from depth-2 majority circuits , 2007, STOC '07.

[6]  Troy Lee,et al.  Disjointness is Hard in the Multiparty Number-on-the-Forehead Model , 2007, 2008 23rd Annual IEEE Conference on Computational Complexity.

[7]  Alexander A. Sherstov.  The pattern matrix method for lower bounds on quantum communication , 2008, STOC '08.

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

[9]  Arkadev Chattopadhyay,et al.  Multiparty Communication Complexity of Disjointness , 2008, Electron. Colloquium Comput. Complex..

[10]  Johan Håstad,et al.  On the power of small-depth threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[11]  Ramamohan Paturi,et al.  On the degree of polynomials that approximate symmetric Boolean functions (preliminary version) , 1992, STOC '92.

[12]  Toniann Pitassi,et al.  Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity , 2005, ICALP.

[13]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[14]  Noam Nisan,et al.  Rounds in communication complexity revisited , 1991, STOC '91.

[15]  Arkadev Chattopadhyay.  Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[16]  A. Razborov.  Quantum communication complexity of symmetric predicates , 2002, quant-ph/0204025.

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