2000 character limit reached
A $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness
Published 24 Aug 2016 in cs.DS and cs.DM | (1608.06980v2)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
