How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Average case complete problems
SIAM Journal on Computing
Journal of Computer and System Sciences
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
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
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
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
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Randomness vs time: derandomization under a uniform assumption
Journal of Computer and System Sciences
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
SIAM Journal on Computing
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
Randomness Extractors and their Many Guises
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences - STOC 2002
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Can every randomized algorithm be derandomized?
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates
SIAM Journal on Computing
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Algebrization: a new barrier in complexity theory
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Two theorems on random polynomial time
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
Computational Complexity
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Low-End Uniform Hardness versus Randomness Tradeoffs for AM
SIAM Journal on Computing
| Hi-index | 0.00 |
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether BPP=P). A beautiful theory of derandomization was developed in recent years in attempt to solve this problem. In this article we survey some recent work on relaxed notions of derandomization that allow the deterministic simulation to err on some inputs. We use this opportunity to also provide a brief overview to some results and research directions in "classical derandomization".