Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ISAAC
2009
Springer

favoriteEmaildiscussreport

98views Algorithms» more ISAAC 2009»

On the Tightness of the Buhrman-Cleve-Wigderson Simulation

13 years 11 months ago

On the Tightness of the Buhrman-Cleve-Wigderson Simulation

Download www.cse.cuhk.edu.hk

Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree computation for f [3]. It is also well-known that this simulation can be very ineﬃcient for some functions f and (g1, · · · , gn). In this paper we show that the simulation is actually polynomially tight up to the choice of (g1, · · · , gn). This also implies that the classical and quantum communication complexities of certain blockcomposed functions are polynomially related.

Shengyu Zhang

Real-time Traffic

Algorithms | Block-composed Functions | Decision Tree Computation | General Communication Protocol | ISAAC 2009 |

claim paper

Related Content

» Tight and efficient surface bounds in meshless animation

» Adaptive deformations with fast tight bounds

» Query Performance for Tightly Coupled Distributed Digital Libraries

» A Tightly Coupled Accelerator Infrastructure for Exact Arithmetics

» Partial mixture model for tight clustering of gene expression timecourse

» Fast and Tight ResponseTimes for Tasks with Offsets

» A hybrid approach for simulating human motion in constrained environments

» An Integrated Approach for Steering Visualization and Analysis of Atmospheric Simulations

» On Estimating TightLink Bandwidth Characteristics over MultiHop Paths

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ISAAC
Authors	Shengyu Zhang

Comments (0)