论文信息 - The power of randomness for communication complexity

The power of randomness for communication complexity

Improving a result of Mehlhorn and Schmidt, a function f with deterministic communication complexity n2 is shown to have Las Vegas communication complexity &Ogr;(n). This is the best possible, because the deterministic complexity cannot be more than the square of the Las Vegas communication complexity for any function.

Martin Fürer

[1] Kurt Mehlhorn,et al. Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[2] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.

[3] Andrew Chi-Chih Yao,et al. The entropic limitations on VLSI computations(Extended Abstract) , 1981, STOC '81.

[4] Alfred V. Aho,et al. On notions of information transfer in VLSI circuits , 1983, STOC.

[5] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.