论文信息 - A $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness

A $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness

Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, $O(n \log(n)/\varepsilon)$-query tester for unateness of Boolean functions $f:\{0,1\}^n \to \{0,1\}$. In this note we describe a simple non-adaptive, $O(n \log(n/\varepsilon)/\varepsilon)$ -query tester for unateness for functions over the hypercube with any ordered range.

Seshadhri Comandur | Deeparnab Chakrabarty

[1] Rocco A. Servedio,et al. New Algorithms and Lower Bounds for Monotonicity Testing , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

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

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

[4] Dana Ron,et al. Testing Monotonicity , 2000, Comb..

[5] Eric Blais,et al. A polynomial lower bound for testing monotonicity , 2016, STOC.

[6] Eyal Kushilevitz,et al. Distribution-Free Property Testing , 2003, RANDOM-APPROX.

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

[8] Seshadhri Comandur,et al. Property Testing on Product Distributions , 2014, ACM Trans. Algorithms.

[9] Kyomin Jung,et al. Transitive-Closure Spanners , 2008, SIAM J. Comput..

[10] Eyal Kushilevitz,et al. The evolution of the mixing rate of a simple random walk on the giant component of a random graph , 2008 .