Constructive Proofs of Concentration Bounds
暂无分享,去创建一个
[1] William Slofstra,et al. Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[2] Thomas Holenstein. Parallel Repetition: Simplification and the No-Signaling Case , 2009, Theory Comput..
[3] Ran Canetti,et al. Hardness Amplification of Weakly Verifiable Puzzles , 2005, TCC.
[4] S. Ross. A random graph , 1981 .
[5] Emanuele Viola,et al. Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols , 2008, Theory Comput..
[6] Leonid A. Levin,et al. One-way functions and pseudorandom generators , 1985, STOC '85.
[7] Ran Raz,et al. A Counterexample to Strong Parallel Repetition , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[8] S. M. Samuels,et al. Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation , 1968 .
[9] Moni Naor,et al. Does parallel repetition lower the error in computationally sound protocols? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[10] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[11] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[12] Kai-Min Chung,et al. Tight Parallel Repetition Theorems for Public-Coin Arguments using KL-divergence , 2015 .
[13] Ran Raz,et al. Direct product results and the GCD problem, in old and new communication models , 1997, STOC '97.
[14] John Langford,et al. CAPTCHA: Using Hard AI Problems for Security , 2003, EUROCRYPT.
[15] Feng-Hao Liu,et al. Parallel Repetition Theorems for Interactive Arguments , 2010, TCC.
[16] Thomas Holenstein,et al. Parallel repetition: simplifications and the no-signaling case , 2007, STOC '07.
[17] Avi Wigderson,et al. Uniform direct product theorems: simplified, optimized, and derandomized , 2008, SIAM J. Comput..
[18] János Komlós,et al. Deterministic simulation in LOGSPACE , 1987, STOC.
[19] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[20] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[21] Russell Impagliazzo,et al. Chernoff-Type Direct Product Theorems , 2007, Journal of Cryptology.
[22] Ronald de Wolf,et al. A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs , 2007, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[23] Russell Impagliazzo,et al. Hard-core distributions for somewhat hard problems , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[24] Iftach Haitner. A Parallel Repetition Theorem for Any Interactive Argument , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[25] Russell Impagliazzo,et al. Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[26] Falk Unger,et al. A Probabilistic Inequality with Applications to Threshold Direct-Product Theorems , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[27] Ronen Shaltiel. Towards proving strong direct product theorems , 2003, computational complexity.
[28] Aravind Srinivasan,et al. Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..
[29] Alexander Healy,et al. Randomness-Efficient Sampling within NC1 , 2006, computational complexity.
[30] Anup Rao,et al. Parallel repetition in projection games and a concentration bound , 2008, SIAM J. Comput..
[31] Alexander Healy. Randomness-Efficient Sampling Within NC1 , 2006, APPROX-RANDOM.
[32] Michael E. Saks,et al. Products and help bits in decision trees , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[33] Charanjit S. Jutla. Almost Optimal Bounds for Direct Product Threshold Theorem , 2010, TCC.
[34] Noam Nisan,et al. On Yao's XOR-Lemma , 1995, Electron. Colloquium Comput. Complex..
[35] Svante Janson,et al. Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.
[36] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[37] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[38] Krzysztof Pietrzak,et al. Parallel Repetition of Computationally Sound Protocols Revisited , 2010, Journal of Cryptology.
[39] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[40] Noga Alon,et al. Derandomized graph products , 1995, computational complexity.
[41] Kazuoki Azuma. WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .
[42] Thomas Holenstein,et al. Key agreement from weak bit agreement , 2005, STOC '05.
[43] Alan Siegel,et al. Median bounds and their application , 1999, SODA '99.