Randomized versus Nondeterministic Communication Complexity


Our main result is the demonstration of a Boolean function <italic>f</italic> with nondeterministic and co-nondeterministic complexities <italic>O</italic>(log <italic>n</italic>) and &#949;-error randomized complexity &OHgr;(log<supscrpt>2</supscrpt> <italic>n</italic>), for 0 &#8804; &#949; &lt; 1/2. This is the first separation of this kind for a… (More)
DOI: 10.1145/129712.129732


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics