The Power and Weakness of Randomness in Computation

  • Avi Wigderson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3887)


Humanity has grappled with the meaning and utility of randomness for centuries. Research in the Theory of Computation in the last thirty years has enriched this study considerably. We describe two main aspects of this research on randomness, demonstrating its power and weakness respectively.


  1. [MR]
    Motwani, Rajeev, Raghavan: Prabhakar Randomized Algorithms. Cambridge University Press, Cambridge (1995)Google Scholar
  2. [G]
    Goldreich: Oded Modern Cryptography. In: Probabilisitc Proofs and Pseudorandomness. Algorithms and Combinatorics, vol. 17, Springer, Heidelberg (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Avi Wigderson
    • 1
  1. 1.Institute for Advanced StudyPrincetonUSA

Personalised recommendations