Boolean Unateness Testing with O(n^3/4) Adaptive Queries

08/19/2017 ∙ by Xi Chen, et al. ∙ 0

We give an adaptive algorithm which tests whether an unknown Boolean function f{0, 1}^n →{0, 1} is unate, i.e. every variable of f is either non-decreasing or non-increasing, or ϵ-far from unate with one-sided error using O(n^3/4/ϵ^2) queries. This improves on the best adaptive O(n/ϵ)-query algorithm from Baleshzar, Chakrabarty, Pallavoor, Raskhodnikova and Seshadhri when 1/ϵ≪ n^1/4. Combined with the Ω(n)-query lower bound for non-adaptive algorithms with one-sided error of [CWX17, BCPRS17], we conclude that adaptivity helps for the testing of unateness with one-sided error. A crucial component of our algorithm is a new subroutine for finding bi-chromatic edges in the Boolean hypercube called adaptive edge search.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.