Madhu Sudan, Luca Trevisan, Salil Vadhan  Home/Search
Context Related
| harvard.edu/~salil/papers...noxor.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: harvard.edu/~salil/research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Impagliazzo and Wigderson [IW97] have recently shown that if there exists a decision problem solvable in time 2 O(n) and having circuit complexity 2 n) (for all but nitely many n) then P = BPP. This result is a culmination of a series of works showing connections between the existence of hard predicates and the existence of good pseudorandom generators. The construction of Impagliazzo and Wigderson goes through three phases of \hardness ampli cation" (a multivariate polynomial... (Update)
Similar documents based on text: More All
3.2: Pseudorandom generators without the XOR Lemma - Sudan, Trevisan, Vadhan (2000) (Correct)
1.0: Pseudorandom generators without the XOR Lemma (Extended.. - Sudan, Trevisan, Vadhan (1999) (Correct)
0.5: An Improved Pseudorandom Generator Based on Hardness of.. - Dedic, Reyzin, Vadhan (2002) (Correct)
BibTeX entry: (Update)
Madhu Sudan, Luca Trevisan, and Salil Vadhan. Pseudorandom generators without the XOR lemma. Technical Report TR98-074, Electronic Colloquium on Computational Complexity, December 1998. http://www.eccc.uni-trier.de/eccc. http://citeseer.ist.psu.edu/article/sudan00pseudorandom.html More
@article{ sudan98pseudorandom,
author = "Madhu Sudan and Luca Trevisan and Salil P. Vadhan",
title = "Pseudorandom generators without the {XOR} Lemma",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
volume = "5",
number = "074",
year = "1998",
url = "citeseer.ist.psu.edu/article/sudan00pseudorandom.html" }
Citations (may not include all citations):493 Communications of the ACM (context) - Valiant, of et al. - 1984
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
339 Theory and applications of trapdoor functions (context) - Yao - 1982
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984
202 The Complexity of Boolean Functions - Wegener - 1987
202 Wiley Series in Telecommunications (context) - Cover, Thomas et al. - 1991
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
140 Decoding of Reed Solomon codes beyond the error-correction b.. - Sudan - 1997
132 Hiding instances in multioracle queries (context) - Beaver, Feigenbaum - 1990
114 Improved decoding of Reed-Solomon and algebraicgeometry code.. - Guruswami, Sudan - 1999
90 A pseudorandom generator from any one-way function - astad, Impagliazzo et al. - 1999
86 New directions in testing (context) - Lipton - 1989
84 Simulating BPP using a general weak random source - Zuckerman - 1996
83 BPP has subexponential time simulations unless EXPTIME has p.. - aszl, Babai et al. - 1993
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.deas.harvard.edu/~salil/research.html): More
The Complexity of Counting - Vadhan (1995) (Correct)
Comparing Entropies in Statistical Zero Knowledge with.. - Goldreich, Vadhan (1999) (Correct)
Checking Polynomial Identities over any Field: Towards a.. - Lewin, Vadhan (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC