Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities

[1]  Dana Ron,et al.  Testing Computability by Width-Two OBDDs , 2009, Electron. Colloquium Comput. Complex..

[2]  Joshua Brody,et al.  Lower Bounds for Testing Computability by Small Width OBDDs , 2011, TAMC.

[3]  Rocco A. Servedio,et al.  Testing Fourier Dimensionality and Sparsity , 2009, SIAM J. Comput..

[4]  Oded Goldreich.  On Testing Computability by Small Width OBDDs , 2010, Electron. Colloquium Comput. Complex..

[5]  Sourav Chakraborty,et al.  Monotonicity testing and shortest-path routing on the cube , 2010, Comb..

[6]  Ryan O'Donnell,et al.  Lower Bounds for Testing Function Isomorphism , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[7]  P. Gopalan,et al.  Fooling Functions of Halfspaces under Product Distributions , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[8]  Oded Goldreich,et al.  Property Testing - Current Research and Surveys , 2010, Property Testing.

[9]  Dana Ron,et al.  Algorithmic and Analysis Techniques in Property Testing , 2010, Found. Trends Theor. Comput. Sci..

[10]  Ryan O'Donnell,et al.  Testing ±1-weight halfspace , 2009, APPROX-RANDOM.

[11]  Alessandro Panconesi,et al.  Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .

[12]  Eric Blais.  Testing juntas nearly optimally , 2009, STOC '09.

[13]  Ryan O'Donnell,et al.  Testing +/- 1-Weight Halfspaces , 2009 .

[14]  Elchanan Mossel,et al.  Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[15]  Ronald de Wolf,et al.  A Brief Introduction to Fourier Analysis on the Boolean Cube , 2008, Theory Comput..

[16]  Eric Blais.  Improved Bounds for Testing Juntas , 2008, APPROX-RANDOM.

[17]  Ryan O'Donnell,et al.  Some topics in analysis of boolean functions , 2008, STOC.

[18]  Rocco A. Servedio,et al.  Testing Halfspaces , 2007, SIAM J. Comput..

[19]  Rocco A. Servedio,et al.  Testing for Concise Representations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[20]  Dana Ron,et al.  Property Testing: A Learning Theory Perspective , 2007, COLT.

[21]  Bernard Chazelle,et al.  Information theory in property testing and monotonicity testing in higher dimension , 2005, Inf. Comput..

[22]  Noga Alon,et al.  Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.

[23]  Dana Ron,et al.  Testing polynomials over general fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[24]  Atri Rudra,et al.  Testing low-degree polynomials over prime fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[25]  Eyal Kushilevitz,et al.  Testing monotonicity over graph products , 2008, Random Struct. Algorithms.

[26]  E. Fischer.  THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .

[27]  Guy Kindler,et al.  Testing juntas , 2002, J. Comput. Syst. Sci..

[28]  Ronitt Rubinfeld,et al.  Monotonicity testing over general poset domains , 2002, STOC '02.

[29]  Dana Ron,et al.  Testing Basic Boolean Formulae , 2002, SIAM J. Discret. Math..

[30]  Dana Ron,et al.  Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..

[31]  C. Schütt,et al.  Projection constants of symmetric spaces and variants of Khintchine's inequality , 1999 .

[32]  Oded Goldreich,et al.  Testing Monotonicity , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[33]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[34]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[35]  I. S. Shiganov.  Refinement of the upper bound of the constant in the central limit theorem , 1986 .

[36]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).