How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Computing algebraic formulas using a constant number of registers
SIAM Journal on Computing
Journal of Computer and System Sciences
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
Size--Depth Tradeoffs for Threshold Circuits
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
A new general derandomization method
Journal of the ACM (JACM)
The Shrinkage Exponent of de Morgan Formulas is 2
SIAM Journal on Computing
An exponential lower bound for depth 3 arithmetic circuits
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Lower bounds on arithmetic circuits via partial derivatives
Computational Complexity
Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
Theoretical Computer Science
Weak Random Sources, Hitting Sets, and BPP Simulations
SIAM Journal on Computing
On TC0, AC0, and arithmetic circuits
Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Depth-3 arithmetic circuits over fields of characteristic zero
Computational Complexity
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
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
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On the Generation of Cryptographically Strong Pseudo-Random Sequences
Proceedings of the 8th Colloquium on Automata, Languages and Programming
On Resource-Bounded Measure and Pseudorandomness
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Improved Derandomization of BPP Using a Hitting Set Generator
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences - STOC 2002
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
The complexity of constructing pseudorandom generators from hard functions
Computational Complexity
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
A (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Elusive functions and lower bounds for arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Amplifying Lower Bounds by Means of Self-Reducibility
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table
SIAM Journal on Computing
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
One-sided versus two-sided error in probabilistic computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
SIAM Journal on Computing
Shielding circuits with groups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., superpolynomial, or even nearly-exponential) circuit size lower bounds for certain problems. In contrast to what is needed for derandomization, existing lower bounds seem rather pathetic (linear-size lower bounds for general circuits [30], nearly cubic lower bounds for formula size [23], nearly n log log n size lower bounds for branching programs [12], n1+cd for depth d threshold circuits [26]). Here, we present two instances where "pathetic" lower bounds of the form n1+ε would suffice to derandomize interesting classes of probabilistic algorithms. We show: - If the word problem over S5 requires constant-depth threshold circuits of size n1+ε for some ε 0, then any language accepted by uniform polynomialsize probabilistic threshold circuits can be solved in subexponential time (and more strongly, can be accepted by a uniform family of deterministic constant-depth threshold circuits of subexponential size.) - If no constant-depth arithmetic circuits of size n1+ε can multiply a sequence of n 3-by-3 matrices, then for every constant d, black-box identity testing for depth-d arithmetic circuits with bounded individual degree can be performed in subexponential time (and even by a uniform family of deterministic constant-depth AC0 circuits of subexponential size).