A Tight Lower Bound for Monotonicity Testing over Large Ranges

In this short note, we give an Ω(min{n/ǫ, |R|2/ǫ}) lower bound for testing functions f : {0, 1}n → R for monotonicity, matching the recent upper bound of Chakrabarty and Seshadhri [12] when the range of f is large.

[1]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[2]  Oded Goldreich,et al.  Introduction to Testing Graph Properties , 2010, Property Testing.

[3]  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..

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

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

[6]  Noga Alon,et al.  Nearly tight bounds for testing function isomorphism , 2011, SODA '11.

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

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

[9]  Seshadhri Comandur,et al.  Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids , 2013, STOC '13.

[10]  Sourav Chakraborty,et al.  Monotonicity Testing and Shortest-Path Routing on the Cube , 2010, APPROX-RANDOM.

[11]  Dana Ron,et al.  Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown , 2010, CIAC.

[12]  Dana Ron,et al.  Testing Computability by Width Two OBDDs , 2009, APPROX-RANDOM.

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

[14]  Venkatesh Medabalimi.  Property Testing Lower Bounds via Communication Complexity , 2012 .

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

[16]  Oded Goldreich.  A Brief Introduction to Property Testing , 2010, Property Testing.

[17]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[18]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[19]  Ronitt Rubinfeld,et al.  Fast approximate PCPs for multidimensional bin-packing problems , 2005, Inf. Comput..

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

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

[22]  Kyomin Jung,et al.  Transitive-Closure Spanners of the Hypercube and the Hypergrid , 2009, Electron. Colloquium Comput. Complex..

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

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

[25]  Noga Alon,et al.  Testing Boolean Function Isomorphism , 2010, APPROX-RANDOM.