2000 character limit reached
An $\widetilde{O}(n)$ Queries Adaptive Tester for Unateness
Published 8 Aug 2016 in cs.DS | (1608.02451v1)
Abstract: We present an adaptive tester for the unateness property of Boolean functions. Given a function $f:{0,1}n \to {0,1}$ the tester makes $O(n \log(n)/\epsilon)$ adaptive queries to the function. The tester always accepts a unate function, and rejects with probability at least 0.9 if a function is $\epsilon$-far from being unate.
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.