How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Expanders, randomness, or time versus space
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
Journal of Computer and System Sciences
On finding primitive roots in finite fields
Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
On extracting randomness from weak random sources (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On Unapproximable Versions of NP-Complete Problems
SIAM Journal on Computing
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
A new general derandomization method
Journal of the ACM (JACM)
Randomness-optimal oblivious sampling
Proceedings of the workshop on Randomized algorithms and computation
Extracting randomness: a survey and new constructions
Journal of Computer and System Sciences
Computing with Very Weak Random Sources
SIAM Journal on Computing
Weak Random Sources, Hitting Sets, and BPP Simulations
SIAM Journal on Computing
Extractors and pseudo-random generators with optimal seed length
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
List decoding algorithms for certain concatenated codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
SIAM Journal on Discrete Mathematics
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Pseudo-random generators for all hardnesses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Perfect information leader election in log * n+0(1) rounds
Journal of Computer and System Sciences
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
SIAM Journal on Computing
Extracting all the randomness and reducing the error in Trevisan's extractors
Journal of Computer and System Sciences - STOC 1999
On Resource-Bounded Measure and Pseudorandomness
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Extractors: optimal up to constant factors
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Derandomizing Arthur-Merlin Games Using Hitting Sets
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Error Reduction for Extractors
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Near-Optimal Conversion of Hardness into Pseudo-Randomness
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Extracting randomness via repeated condensing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Extractors from Reed-Muller Codes
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
One-sided versus two-sided error in probabilistic computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
IEEE Transactions on Information Theory
Explicit capacity-achieving list-decodable codes
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Hardness amplification proofs require majority
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Limitations of Hardness vs. Randomness under Uniform Reductions
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
The complexity of the matroid–greedoid partition problem
Theoretical Computer Science
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Journal of the ACM (JACM)
Extractors Using Hardness Amplification
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
List decoding and pseudorandom constructions
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Typically-correct derandomization
ACM SIGACT News
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
SIAM Journal on Computing
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
High-rate codes with sublinear-time decoding
Proceedings of the forty-third annual ACM symposium on Theory of computing
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Kakeya Sets, New Mergers, and Old Extractors
SIAM Journal on Computing
On obtaining pseudorandomness from error-correcting codes
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Some results on average-case hardness within the polynomial hierarchy
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On derandomization and average-case complexity of monotone functions
Theoretical Computer Science
Noise-resilient group testing: Limitations and constructions
Discrete Applied Mathematics
A new family of locally correctable codes based on degree-lifted algebraic geometry codes
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
Hi-index | 0.01 |
A “randomness extractor” is an algorithm that given a sample from a distribution with sufficiently high min-entropy and a short random seed produces an output that is statistically indistinguishable from uniform. (Min-entropy is a measure of the amount of randomness in a distribution.) We present a simple, self-contained extractor construction that produces good extractors for all min-entropies. Our construction is algebraic and builds on a new polynomial-based approach introduced by Ta-Shma et al. [2001b]. Using our improvements, we obtain, for example, an extractor with output length m = k/(log n)O(1/α) and seed length (1 + α)log n for an arbitrary 0 n is the input length, and k is the min-entropy of the input distribution.A “pseudorandom generator” is an algorithm that given a short random seed produces a long output that is computationally indistinguishable from uniform. Our technique also gives a new way to construct pseudorandom generators from functions that require large circuits. Our pseudorandom generator construction is not based on the Nisan-Wigderson generator [Nisan and Wigderson 1994], and turns worst-case hardness directly into pseudorandomness. The parameters of our generator match those in Impagliazzo and Wigderson [1997] and Sudan et al. [2001] and in particular are strong enough to obtain a new proof that P = BPP if E requires exponential size circuits.Our construction also gives the following improvements over previous work:---We construct an optimal “hitting set generator” that stretches O(log n) random bits into sΩ(1) pseudorandom bits when given a function on log n bits that requires circuits of size s. This yields a quantitatively optimal hardness versus randomness tradeoff for both RP and BPP and solves an open problem raised in Impagliazzo et al. [1999].---We give the first construction of pseudorandom generators that fool nondeterministic circuits when given a function that requires large nondeterministic circuits. This technique also give a quantitatively optimal hardness versus randomness tradeoff for AM and the first hardness amplification result for nondeterministic circuits.