APPROX
2008
Springer
14 years 1 months ago
2008
Springer
We exhibit an explicit function f : {0,1}n {0,1} that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires n(1) bits of...