Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Eigenvalues and expansion of regular graphs
Journal of the ACM (JACM)
Computational Complexity
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Extracting randomness: a survey and new constructions
Journal of Computer and System Sciences
Locally Testable Codes and PCPs of Almost-Linear Length
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Computationally efficient error-correcting codes and holographic proofs
Computationally efficient error-correcting codes and holographic proofs
European Journal of Combinatorics
Derandomizing homomorphism testing in general groups
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
A Chernoff bound for random walks on expander graphs
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Strong converse for identification via quantum channels
IEEE Transactions on Information Theory
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Randomness-Efficient Sampling within NC1
Computational Complexity
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Randomness-efficient sampling within NC1
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Hi-index | 0.00 |
In this paper we give a randomness-efficient sampler for matrix-valued functions. Specifically, we show that a random walk on an expander approximates the recent Chernoff-like bound for matrix-valued functions of Ahlswede and Winter [1], in a manner which depends optimally on the spectral gap. The proof uses perturbation theory, and is a generalization of Gillman驴s and Lezaud驴s analyses of the Ajtai-Komlos-Szemeredi sampler for realvalued functions [11, 21, 2]. Derandomizing our sampler gives a few applications, yielding deterministic polynomial time algorithms for problems in which derandomizing independent sampling gives only quasi-polynomial time deterministic algorithms. The first (which was our original motivation) is to a polynomialtime derandomization of the Alon-Roichmantheorem [4, 20, 22]: given a group of size n, find O(log n) elements which generate it as an expander. This implies a second application efficiently constructing a randomness-optimal homomorphism tester, significantly improving the previous result of Shpilka and Wigderson [29]. A third application, which derandomizes a generalization of the set cover problem, is deferred to the full version of this paper.