Pairwise independence and derandomization.(Author abstract)
Publication Date: 01-SEP-06
Publication Title: Foundations and Trends in Theoretical Computer Science
Format: Online
Author: Luby, Michael ; Wigderson, Avi

Read this article now
Try Goliath Business News - FREE!
You can view this article PLUS...

  • Over 5 million business articles
  • Hundreds of the most trusted magazines, newswires, and journals (see list)
  • Premium business information that is timely and relevant
  • Unlimited Access

Now for a Limited Time, try Goliath Business News
Free for 7 Days!

Tell Me More   Terms and Conditions

Purchase this article for $4.95

Description

Abstract

This article gives several applications of the following paradigm, which has proven extremely powerful in algorithm design and computational complexity. First, design a probabilistic algorithm for a given problem. Then, show that the correctness analysis of the algorithm remains valid even when the random strings used by the...



More articles from Foundations and Trends in Theoretical Computer Science
1 Pairwise independence.(Pairwise Independence and Derandomization), September 01, 2006
2 Limited independence probability spaces.(Pairwise Independence and D..., September 01, 2006
3 Pairwise independence and complexity classes.(Pairwise Independence ..., September 01, 2006
4 Recycling randomness.(Pairwise Independence and Derandomization), September 01, 2006
5 Pseudo-random generators.(Pairwise Independence and Derandomization), September 01, 2006

Looking for additional articles?
Click here to search our database of over 3 million articles.