Abstract
The power of randomness in improving the efficiency (or even possibility) of computations has been demonstrated in numerous contexts. A fundamental question ishow much randomness is required for these improvements, or how does the improvement grow as a function of the amount of randomness allowed. This quantitative question, restricted to the context of communication complexity, is the focus of our paper.
We prove general lower bounds on the amount of randomness used in randomized protocols for computing a functionf, the input of which is split between two parties. The bounds depend on the number of bits communicated and the deterministic communication complexity off. Four models for communication complexity are considered: the random input of the parties may be public or private, and the communication may be one-way or two-way. (Unbounded advantage is allowed.)
The bounds are shown to be tight; i.e., we demonstrate functions and protocols for these functions which meet the above bounds up to a constant factor. We do this for all the models, for all values of the deterministic communication complexity, and for all possible quantities of bits communicated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Aleliunas, Randomized parallel communication, inProc. of 1st PODC (1982), 60–72.
N. Alon, P. Frankl and V. Rödl, Geometrical realization of set systems and probabilistic communication complexity,Proc. of 26th FOCS (1982), 277–280.
E. Bach andV. Shoup, Factoring polynomials using fewer random Bits,Journal of Symbolic Computation no. 9 (1990), 229–239.
M. Bellare, O. Goldreich and S. Goldwasser, Randomness in interactive proofs,Proc. of 31st FOCS (1990), 563–571.
A. Borodin andJ. E. Hopcroft, Routing, merging, and sorting on parallel models of computing,Journal of Computer and System Science no. 30 (1985), 130–145.
M. Blum anS. Micali, How to generate cryptographically strong sequences of pseudo-random bits,SIAM J. Comput. 13 (Nov. 1984), 850–864.
R. Canetti and O. goldreich, Bounds on tradeoffs between randomness and communication complexity,Proc. of 31st FOCS (1990), 766–775.
B. Chor andC. Dwork, Randomization in byzantine agreements,Advances in Computing Research, Vol.5 (1989), 443–497.
B. Chor andO. Goldreich Unbiased bits from sources of weak randomness and probabilistic communication complexity,SIAM J. Comp., Vol 17,No. 2 (1988), 230–261.
A. Cohen and A. Wigderson, Dispersers, deterministic amplification, and weak random sources,30th FOCS (1989), 14–19.
T. Feder, E. Kushilevitz and M. Naor, Amortized communication complexity,32nd FOCS (1991), 239–248.
M. J. Fischer, N. A. Lynch andN. Paterson, “Impossibility of distributed consensus with one faulty process”,JACM, Vol. 32,no. 2 (1985), 374–382.
R. Fleischer, H. Jung and K. Melhorn, “A time-randomness tradeoff for communication complexity”,4th International Workshop on Distributed Algorithms (1990).
W. Hoefding, “Probability inequalities for sums of bounded random variables”,Journal of the American Statistical Association, Vol.58 (1963), 13–30.
R. Impagliazzo and D. Zuckerman, “How to recycle random bits”,Proc. of 30th FOCS (1989), 248–253.
H. J. Karloff and P. Raghavan, “Randomized algorithms and pseudorandom generators”,Proc. of 20th STOC (1988), 310–321.
D. E. Knuth andA. C. Yao, The complexity of non uniform random number generation, Algorithms and Complexity, ed. J.Traub AC press, New York (1976), 357–428.
D. Krizanc, D. Peleg, and E. Upfal, A time-randomness tradeoff for oblivious routing,Proc. of 20th STOC (1988), 93–102.
K. Melhorn and E. Schmidt, Las-Vegas is better than determinism in VLSI and distributed computing,Proc. of 14th STOC (1982), 330–337.
I. Newman, Private vs. common random bits in communication complexity,Information Processing Letters 39 (1991), 67–71.
N. Nisan, Pseudorandom generator for space bounded computationProc. of 22nd STOC (1990), 204–212.
R. Paturi andJ. Simon, Probabilistic communication complexity,Journal of Computer and System Science, Vol. 33 (1986), 106–123.
D. Peleg andE. Upfal, A time-randomness tradeoff for oblivious routing,SIAM J. on Computing no. 19 (1990), 256–266.
M. Rabin, Randomized Byzantine generals,Proc. of 24th FOCS (1983), 403–409.
M. Rabin and A. C. Yao, private communication via M. Rabin (1990).
P. Raghavan and M. Snir, Memory versus randomization in on-line algorithms,Proc. of 16th ICALP (1989), 687–703.
M. Sipser, Expanders, randomness, or time versus space,Proc. of Structure in Complexity Theory, in Lecture Notes in Computer Science no. 223, ed. Springer-Verlag (1989), 325–329.
L. G. Valiant, A scheme for fast parallel communication,SIAM Journal of Computing, Vol.11, No.2 (1982), 350–361.
U. Vazirani and V. Vazirani, Random polynomial time is equal to slightlyrandom polynomial time','Proc. of 26th FOCS (1985), 417–428.
A. C. Yao, Probabilistic complexity: towards a unified measure of complexity,Proc. of 18th STOC (1977), 222–227.
A. C. Yao, Some complexity questions related to distributive computing,Proc. of 11th STOC (1979), 209–213.
A. C. Yao, Theory and applications of trapdoor functions,Proc. of 23rd FOCS (1982), 80–91.
D. zuckerman, Simulating BPP using a general weak random source,Proc. of 32nd FOCS (1991), 79–89.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Canetti, R., Goldreich, O. Bounds on tradeoffs between randomness and communication complexity. Comput Complexity 3, 141–167 (1993). https://doi.org/10.1007/BF01200118
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01200118