Sciweavers

STOC
1992
ACM

Randomized versus Nondeterministic Communication Complexity

14 years 3 months ago
Randomized versus Nondeterministic Communication Complexity
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean function f with nondeterministic and conondeterministic complexities O (log n) and c-error randomized complexity fl(log2 n), for O < c < 1/2. This is the first separation of this kind for a decision problem.
Paul Beame, Joan Lawry
Added 11 Aug 2010
Updated 11 Aug 2010
Type Conference
Year 1992
Where STOC
Authors Paul Beame, Joan Lawry
Comments (0)