A concentration inequality for the overlap of a vector on a large set, with application to the communication complexity of the Gap-Hamming-Distance problem
暂无分享,去创建一个
[1] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .
[2] Frank E. Grubbs,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[3] Andrew C. Yao,et al. Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[4] E. Kushilevitz,et al. Communication Complexity: Basics , 1996 .
[5] Hartmut Klauck,et al. The Partition Bound for Classical Communication Complexity and Query Complexity , 2009, 2010 IEEE 25th Annual Conference on Computational Complexity.
[6] Joshua Brody,et al. Better Gap-Hamming Lower Bounds via Better Round Elimination , 2010, APPROX-RANDOM.
[7] Amit Chakrabarti,et al. An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance , 2012, SIAM J. Comput..
[8] Alexander A. Sherstov. The Communication Complexity of Gap Hamming Distance , 2012, Theory Comput..
[9] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.