Abstract
We prove that any non-adaptive algorithm that tests whether an unknown Boolean function f: {0, 1}n → {0, 1} is a k-junta or e-far from every k-junta must make [EQUATION](k3/2 /e) many queries for a wide range of parameters k and e. Our result dramatically improves previous lower bounds from [12, 38], and is essentially optimal given Blais's non-adaptive junta tester from [7], which makes [EQUATION](k3/2)/e queries. Combined with the adaptive tester of [8] which makes O(k log k + k/e) queries, our result shows that adaptivity enables polynomial savings in query complexity for junta testing.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
