Improved Separations between Nondeterministic and Randomized Multiparty Communication

15 years 16 days ago

Download www.cs.toronto.edu

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 communication for randomized number-on-forehead protocols with k =

Matei David, Toniann Pitassi, Emanuele Viola

Real-time Traffic

Algorithms | APPROX 2008 | Explicit Function | Nondeterministic Number-on-forehead Protocol | Number-on-forehead Protocols |

claim paper

» Exponential Separation of Quantum and Classical Noninteractive Multiparty Communication Co...

» Lower Bounds on Quantum Multiparty Communication Complexity

» Multiparty Computation with Low Communication Computation and Interaction via Threshold FH...

» Flexible Group Key Exchange with Ondemand Computation of Subgroup Keys

» Discrepancy and the Power of Bottom Fanin in Depththree Circuits

» The Privacy of kNN Retrieval for Horizontal Partitioned Data New Methods and Applications

» Wireless Medium Access via Adaptive Backoff Delay and Loss Minimization

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	APPROX
Authors	Matei David, Toniann Pitassi, Emanuele Viola

Comments (0)

Sciweavers

Improved Separations between Nondeterministic and Randomized Multiparty Communication

Algorithms | APPROX 2008 | Explicit Function | Nondeterministic Number-on-forehead Protocol | Number-on-forehead Protocols |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers