New Lower Bounds for Adaptive Tolerant Junta Testing

We prove a k^{-\Omega\left(\log \left(\varepsilon_{2}-\varepsilon_{1}\right)\right)} lower bound for adap- tively testing whether a Boolean function is \varepsilon_{1}-close to or \varepsilon_{2}- far from k-juntas. Our results provide the first superpolynomial separation between tolerant and non-to...

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 1778 - 1786
Main Authors:	Chen, Xi, Patel, Shyamal
Format:	Conference Proceeding
Language:	English
Published:	IEEE 06.11.2023
Subjects:	Boolean functions Computer science Juntas Property Testing Sublinear Algorithms Testing Tolerant Testing
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!