Nondeterministic Communication Complexity of Random Boolean Functions
Abstract
We study nondeterministic communication complexity and related concepts (fooling sets, fractional covering number) of random functions f X× Y \0,1\ where each value is chosen to be 1 independently with probability p=p(n), n := |X|=|Y|.
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.