Nondeterministic Communication Complexity of Random Boolean Functions

preprint2016arXivOpen access

We study nondeterministic communication complexity and related concepts (fooling sets, fractional covering number) of random functions $f\colon X\times Y \to \{0,1\}$ where each value is chosen to be 1 independently with probability $p=p(n)$ , $n := |X|=|Y|$ .

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Nondeterministic Communication Complexity of Random Boolean Functions

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0