Improved Algorithm for Tolerant Junta Testing

12/02/2019
by   Xiaojin Zhang, et al.
0

In this paper, we consider the problem of tolerant junta testing for boolean function. Compared with the prior work by Blais et al., we provide improved results in terms of both the parameter gap and query complexity. Compared with the prior work by De et al., our work did not close the parameter gap, but we removed the 2^k term of the query complexity.

READ FULL TEXT

page 1

page 2

research
11/04/2018

Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions on Hypergrids

Testing monotonicity of Boolean functions over the hypergrid, f:[n]^d →{...
research
04/27/2023

Compact Distance Oracles with Large Sensitivity and Low Stretch

An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch ...
research
04/26/2022

Tolerant Bipartiteness Testing in Dense Graphs

Bipartite testing has been a central problem in the area of property tes...
research
04/17/2015

Testing Closeness With Unequal Sized Samples

We consider the problem of closeness testing for two discrete distributi...
research
07/26/2022

Maximum Weight Convex Polytope

We study the maximum weight convex polytope problem, in which the goal i...
research
10/05/2020

Why Older Adults (Don't) Use Password Managers

Password managers (PMs) are considered highly effective tools for increa...
research
12/30/2018

Spectral methods for testing cluster structure of graphs

In the framework of graph property testing, we study the problem of dete...

Please sign up or login with your details

Forgot password? Click here to reset