Year: 2019
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Author: Zhang, Xiaojin
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2990512674