Sciweavers

133
Voted
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
15 years 10 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 fu...
Paul Beame, Joan Lawry