Abstract 1 Introduction - CiteSeerX

18 downloads 0 Views 206KB Size Report
tor for what we call bounded read-multiplicity. Logspace ... This obviously suits our model. The ..... read-multiplicity is a Turing machine which runs in space S ...
Pseudorandomness for Network Algorithms Russell Impagliazzo 

Noam Nisan y

Abstract We de ne pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive composition of such generators to obtain pseudorandom generators that fool distributed network algorithms. While the construction and the proofs are simple, we demonstrate the generality of such generators by giving several applications.

1 Introduction The theory of pseudorandomness is aimed at understanding the minimum amount of randomness that a probabilistic model of computation actually needs. A typical result shows that n truly random bits used by the model can be replaced by n pseudorandom ones, generated deterministically from m