A randomness-efficient sampler for matrix-valued functions and applications
暂无分享,去创建一个
[1] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[2] M. Murty. Ramanujan Graphs , 1965 .
[3] S. Golden. LOWER BOUNDS FOR THE HELMHOLTZ FUNCTION , 1965 .
[4] C. Thompson. Inequality with Applications in Statistical Mechanics , 1965 .
[5] Tosio Kato. Perturbation theory for linear operators , 1966 .
[6] N. Z. Shor. Cut-off method with space extension in convex programming problems , 1977, Cybernetics.
[7] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..
[8] H. Baumgärtel. Analytic perturbation theory for matrices and operators , 1985 .
[9] János Komlós,et al. Deterministic simulation in LOGSPACE , 1987, STOC.
[10] D. Aldous. On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing , 1987, Probability in the Engineering and Informational Sciences.
[11] Avi Wigderson,et al. Dispersers, deterministic amplification, and weak random sources , 1989, 30th Annual Symposium on Foundations of Computer Science.
[12] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[13] Moni Naor,et al. Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.
[14] Leonid A. Levin,et al. Security preserving amplification of hardness , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[15] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[16] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[17] Noga Alon,et al. Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.
[18] Nabil Kahale,et al. Eigenvalues and expansion of regular graphs , 1995, JACM.
[19] D. Spielman,et al. Computationally efficient error-correcting codes and holographic proofs , 1995 .
[20] Oded Goldreich,et al. A Sample of Samplers - A Computational Perspective on Sampling (survey) , 1997, Electron. Colloquium Comput. Complex..
[21] D. Gillman. A Chernoff bound for random walks on expander graphs , 1998, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[22] P. Lezaud. Chernoff-type bound for finite Markov chains , 1998 .
[23] Noam Nisan,et al. Extracting Randomness: A Survey and New Constructions , 1999, J. Comput. Syst. Sci..
[24] Avi Wigderson,et al. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[25] S. Hoory. Hypergraph Codes , 2001 .
[26] Ronen Shaltiel,et al. Recent Developments in Explicit Constructions of Extractors , 2002, Bull. EATCS.
[27] Rudolf Ahlswede,et al. Strong converse for identification via quantum channels , 2000, IEEE Trans. Inf. Theory.
[28] Avi Wigderson,et al. Derandomizing homomorphism testing in general groups , 2004, STOC '04.
[29] Alexander Russell,et al. Random Cayley Graphs are Expanders: a Simple Proof of the Alon-Roichman Theorem , 2004, Electron. J. Comb..
[30] A. Winter,et al. Randomizing Quantum States: Constructions and Applications , 2003, quant-ph/0307104.
[31] Leonard J. Schulman,et al. Improved Expansion of Random Cayley Graphs , 2004, Discret. Math. Theor. Comput. Sci..
[32] Shlomo Hoory,et al. On codes from hypergraphs , 2004, Eur. J. Comb..
[33] Noga Alon,et al. Derandomized graph products , 1995, computational complexity.
[34] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[35] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .