A lower bound for testing juntas

Authors:
Hana Chockler;Dan Gutfreund
Affiliations:
College of Computer and Information Science, Northeastern University, Boston, MA;School of Engineering and Computer Science, Hebrew University, Jerusalem 91904, Israel
Venue:
Information Processing Letters
Year:
2004

Citing 8
Cited 13

Self-testing/correcting with applications to numerical problems

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Randomized algorithms

Randomized algorithms
Property testing in bounded degree graphs

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation

Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing

SIAM Journal on Computing
Testing k-colorability

SIAM Journal on Discrete Mathematics
Testing Juntas

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Regular Languages are Testable with a Constant Number of Queries

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Quantum Algorithms for Learning and Testing Juntas

Quantum Information Processing
Improved Bounds for Testing Juntas

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Property Testing: A Learning Theory Perspective

Foundations and Trends® in Machine Learning
Testing juntas nearly optimally

Proceedings of the forty-first annual ACM symposium on Theory of computing
Algorithmic and Analysis Techniques in Property Testing

Foundations and Trends® in Theoretical Computer Science
Testing Boolean function isomorphism

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Testing juntas: a brief survey

Property testing
Testing by implicit learning: a brief survey

Property testing
Testing juntas: a brief survey

Property testing
Testing by implicit learning: a brief survey

Property testing
On approximating the number of relevant variables in a function

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Local correction of juntas

Information Processing Letters
On Approximating the Number of Relevant Variables in a Function

ACM Transactions on Computation Theory (TOCT)

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show an Ω(m) lower bound on the number of queries required to test whether a Boolean function depends on at most m out of its n variables. This improves a previously known lower bound for testing this property. Our proof is simple and uses only elementary techniques.