Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > UNATENESS:
Reports tagged with Unateness:
TR16-126 | 8th August 2016
Subhash Khot, Igor Shinkar

#### An $\widetilde{O}(n)$ Queries Adaptive Tester for Unateness

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 any function that is $\epsilon$-far from being unate.
more >>>

TR18-094 | 2nd May 2018
Amit Levi, Erik Waingarten

#### Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs

We introduce a new model for testing graph properties which we call the \emph{rejection sampling model}. We show that testing bipartiteness of $n$-nodes graphs using rejection sampling queries requires complexity $\widetilde{\Omega}(n^2)$. Via reductions from the rejection sampling model, we give three new lower bounds for tolerant testing of Boolean functions ... more >>>

ISSN 1433-8092 | Imprint