Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
The computational complexity of universal hashing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Lower bounds for sampling algorithms for estimating the average
Information Processing Letters
Randomized algorithms
Randomness in interactive 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
Randomness-optimal oblivious sampling
Proceedings of the workshop on Randomized algorithms and computation
A Chernoff Bound for Random Walks on Expander Graphs
SIAM Journal on Computing
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Randomization and Derandomization in Space-Bounded Computation
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Deterministic Amplification of Space-Bounded Probabilistic Algorithms
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
A theorem on probabilistic constant depth Computations
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Large Deviation Bounds for Markov Chains
Combinatorics, Probability and Computing
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The complexity of constructing pseudorandom generators from hard functions
Computational Complexity
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates
SIAM Journal on Computing
Conductance and convergence of Markov chains-a combinatorial treatment of expanders
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Dispersers, deterministic amplification, and weak random sources
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Security preserving amplification of hardness
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Linear advice for randomized logarithmic space
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Constant-Depth circuits for arithmetic in finite fields of characteristic two
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Guest Column: correlation bounds for polynomials over {0 1}
ACM SIGACT News
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
Constructive proofs of concentration 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
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
| Hi-index | 0.00 |
We construct a randomness-efficient averaging sampler that is computable by uniform constant-depth circuits with parity gates (i.e., in uniform AC 0[]). Our sampler matches the parameters achieved by random walks on constant-degree expander graphs, allowing us to apply a variety expander-based techniques within NC 1. For example, we obtain the following results: Randomness-efficient error-reduction for uniform probabilistic NC 1, TC 0, AC 0[] and AC 0: Any function computable by uniform probabilistic circuits with error 1/3 using r random bits is computable by circuits of the same type with error δ using r + O(log(1/δ)) random bits. An optimal bitwise biased generator in AC 0[]: There exists a 1/2Ω(n)-biased generator G : {0, 1} O(n) - {0, 1}2n for which poly(n)-size uniform AC 0[] circuits can compute G(s) i given (s, i) {0, 1} O(n) x驴 {0, 1} n . This resolves question raised by Gutfreund and Viola (Random 2004). uniform BP . AC 0 uniform AC 0/O(n). Our sampler is based on the zig-zag graph product of Reingold, Vadhan & Wigderson (Annals of Math 2002) and as part of our analysis we givean elementary proof of a generalization of Gillman's Chernoff Bound for Expander Walks (SIAM Journal on Computing 1998).