Separating NOF communication complexity classes RP and NP

Details Separating NOF communication complexity classes RP and NP Separating NOF communication complexity classes RP and NP

2008-02-26

arxiv.org/abs/0802.3860v1

Computer Science

Computational Complexity

Scientific paper

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 \delta log(n)
for any \delta<1. Recent lower bounds on Set-Disjointness [LS08,CA08] provide
an explicit separation between these classes when the number of players is only
up to o(loglog(n)).

Affiliated with

Also associated with

No associations

Rating

Separating NOF communication complexity classes RP and NP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Separating NOF communication complexity classes RP and NP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Separating NOF communication complexity classes RP and NP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-607195