Testing juntas: a brief survey

Authors:
Eric Blais
Affiliations:
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Venue:
Property testing
Year:
2010

Citing 25
Cited 0

Self-testing polynomial functions efficiently and over rational domains

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
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
Learning in the presence of finitely or infinitely many irrelevant attributes

Journal of Computer and System Sciences
Selection of relevant features and examples in machine learning

Artificial Intelligence - Special issue on relevance
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
Property testing and its connection to learning and approximation

Journal of the ACM (JACM)
Quantum lower bounds by polynomials

Journal of the ACM (JACM)
Testing Basic Boolean Formulae

SIAM Journal on Discrete Mathematics
Quantum property testing

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Finding Relevant Variables in PAC Model with Membership Queries

ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
A lower bound for testing juntas

Information Processing Letters
Testing juntas

Journal of Computer and System Sciences - Special issue on FOCS 2002
Learning functions of k relevant variables

Journal of Computer and System Sciences - Special issue: STOC 2003
On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas

CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Quantum Algorithms for Learning and Testing Juntas

Quantum Information Processing
Testing for Concise Representations

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
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
On the Benefits of Adaptivity in Property Testing of Dense Graphs

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Testing halfspaces

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Testing juntas nearly optimally

Proceedings of the forty-first annual ACM symposium on Theory of computing
Algorithmic Aspects of Property Testing in the Dense Graphs Model

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Testing by implicit learning: a brief survey

Property testing
Query-efficient dictatorship testing with perfect completeness

Property testing
Algorithmic aspects of property testing in the dense graphs model

Property testing
Linearity testing in characteristic two

IEEE Transactions on Information Theory - Part 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

A function on n variables is called a k-junta if it depends on at most k of its variables. In this survey, we review three recent algorithms for testing k-juntas with few queries.