Separating NOF communication complexity classes RP and NP
Abstract
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 Set-Disjointness [LS08,CA08] provide an explicit separation between these classes when the number of players is only up to o(loglog(n)).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.