Property Testing Lower Bounds via Communication Complexity
暂无分享,去创建一个
[1] Avi Wigderson,et al. The Randomized Communication Complexity of Set Disjointness , 2007, Theory Comput..
[2] Sourav Chakraborty,et al. Monotonicity Testing and Shortest-Path Routing on the Cube , 2010, APPROX-RANDOM.
[3] Joshua Brody,et al. Better Gap-Hamming Lower Bounds via Better Round Elimination , 2010, APPROX-RANDOM.
[4] Peter Bro Miltersen,et al. On data structures and asymmetric communication complexity , 1994, STOC '95.
[5] Eric Blais,et al. Testing Properties of Linear Functions , 2012 .
[6] Ronitt Rubinfeld,et al. Fast approximate PCPs for multidimensional bin-packing problems , 2005, Inf. Comput..
[7] R. M. deWolf. A Brief Introduction to Fourier Analysis on the Boolean Cube , 2008 .
[8] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[9] Rocco A. Servedio,et al. Testing for Concise Representations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[10] Guy Kindler,et al. Testing juntas , 2002, J. Comput. Syst. Sci..
[11] Venkatesh Medabalimi. Property Testing Lower Bounds via Communication Complexity , 2012 .
[12] Eric Blais. Testing juntas nearly optimally , 2009, STOC '09.
[13] Alexander A. Razborov,et al. On the Distributional Complexity of Disjointness , 1990, Theor. Comput. Sci..
[14] Ziv Bar-Yossef,et al. An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[15] Oded Goldreich. On Testing Computability by Small Width OBDDs , 2010, Electron. Colloquium Comput. Complex..
[16] Dana Ron,et al. Testing Basic Boolean Formulae , 2002, SIAM J. Discret. Math..
[17] O. Svensson,et al. Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling , 2007, FOCS 2007.
[18] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[19] Dana Ron,et al. Testing Monotonicity , 2000, Comb..
[20] MICHAL PARNAS,et al. On Testing Convexity and Submodularity , 2002, SIAM J. Comput..
[21] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[22] Dana Ron,et al. Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..
[23] Daniel M. Kane,et al. Tight Bounds for Testing k-Linearity , 2012, APPROX-RANDOM.
[24] E. Kushilevitz,et al. Communication Complexity: Basics , 1996 .
[25] Dana Ron,et al. Testing Computability by Width Two OBDDs , 2009, APPROX-RANDOM.
[26] Hana Chockler,et al. A lower bound for testing juntas , 2004, Inf. Process. Lett..
[27] Ilan Newman,et al. Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..
[28] Dana Ron,et al. Testing Computability by Width-Two OBDDs , 2009, Electron. Colloquium Comput. Complex..
[29] David P. Woodruff,et al. Tight lower bounds for the distinct elements problem , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[30] Ronitt Rubinfeld,et al. Monotonicity testing over general poset domains , 2002, STOC '02.
[31] Kyomin Jung,et al. Transitive-Closure Spanners of the Hypercube and the Hypergrid , 2009, Electron. Colloquium Comput. Complex..
[32] Oded Goldreich,et al. Property Testing - Current Research and Surveys , 2010, Property Testing.
[33] Ryan O'Donnell,et al. Testing ±1-weight halfspace , 2009, APPROX-RANDOM.
[34] Dana Ron,et al. Algorithmic and Analysis Techniques in Property Testing , 2010, Found. Trends Theor. Comput. Sci..
[35] Noga Alon,et al. Testing Boolean Function Isomorphism , 2010, APPROX-RANDOM.
[36] Dana Ron,et al. On Approximating the Number of Relevant Variables in a Function , 2013, TOCT.
[37] Ronald de Wolf,et al. A Brief Introduction to Fourier Analysis on the Boolean Cube , 2008, Theory Comput..
[38] Ryan O'Donnell,et al. Lower Bounds for Testing Function Isomorphism , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.
[39] Ryan O'Donnell,et al. Testing +/- 1-Weight Halfspaces , 2009 .
[40] Ryan O'Donnell,et al. Some topics in analysis of boolean functions , 2008, STOC.
[41] Joshua Brody,et al. Property Testing Lower Bounds via Communication Complexity , 2011, Computational Complexity Conference.
[42] Ronitt Rubinfeld,et al. Spot-checkers , 1998, STOC '98.
[43] Jirí Sgall,et al. 38th International Colloquium on Automata, Languages and Programming , 2013, Inf. Comput..
[44] Jan Vondrák,et al. Is Submodularity Testable? , 2010, Algorithmica.
[45] Bala Kalyanasundaram,et al. The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..
[46] Dana Ron. Property Testing: A Learning Theory Perspective , 2008, Found. Trends Mach. Learn..
[47] Sourav Chakraborty,et al. Efficient Sample Extractors for Juntas with Applications , 2011, ICALP.
[48] Eric Blais. Improved Bounds for Testing Juntas , 2008, APPROX-RANDOM.
[49] Avi Wigderson,et al. Quantum vs. classical communication and computation , 1998, STOC '98.
[50] Noga Alon,et al. Nearly tight bounds for testing function isomorphism , 2011, SODA '11.
[51] Manuel Blum,et al. Self-Testing/Correcting with Applications to Numerical Problems , 1993, J. Comput. Syst. Sci..
[52] Joshua Brody,et al. Lower Bounds for Testing Computability by Small Width OBDDs , 2011, TAMC.
[53] Amit Chakrabarti,et al. An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance , 2012, SIAM J. Comput..
[54] Ronitt Rubinfeld,et al. Spot-Checkers , 2000, J. Comput. Syst. Sci..