Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
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)
On the Robustness of Functional Equations
SIAM Journal on Computing
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Testing Basic Boolean Formulae
SIAM Journal on Discrete Mathematics
Improved Testing Algorithms for Monotonicity
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Testing that distributions are close
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Testing Random Variables for Independence and Identity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Some improvements to total degree tests
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Sublinear algorithms for testing monotone and unimodal distributions
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - Special issue on FOCS 2002
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Testing Low-Degree Polynomials over Prime Fields
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Some 3CNF Properties Are Hard to Test
SIAM Journal on Computing
The Complexity of Approximating the Entropy
SIAM Journal on Computing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Symposium on Theory of Computing Conference 2006
A combinatorial characterization of the testable graph properties: it's all about regularity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Graph limits and parameter testing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Testing Polynomials over General Fields
SIAM Journal on Computing
Testing k-wise and almost k-wise independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
SIAM Journal on Computing
Testing for Concise Representations
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the fortieth annual ACM symposium on Theory of computing
Symposium on Theory of Computing Conference 2008
Testing symmetric properties of distributions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebraic property testing: the role of invariance
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
2-Transitivity Is Insufficient for Local Testability
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
On the Randomness Complexity of Property Testing
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 monotone high-dimensional distributions
Random Structures & Algorithms - Proceedings of the Thirteenth International Conference “Random Structures and Algorithms” held May 28–June 1, 2007, Tel Aviv, Israel
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Note: A combinatorial proof of the Removal Lemma for Groups
Journal of Combinatorial Theory Series A
Proceedings of the forty-first annual ACM symposium on Theory of computing
Symposium on Theory of Computing Conference
On proximity oblivious testing
Proceedings of the forty-first annual ACM symposium on Theory of computing
Testing juntas nearly optimally
Proceedings of the forty-first annual ACM symposium on Theory of computing
Green's conjecture and testing linear-invariant properties
Proceedings of the forty-first annual ACM symposium on Theory of computing
Testing Fourier Dimensionality and Sparsity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Succinct Representation of Codes with Applications to Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
SIAM Journal on Computing
Lower bounds for testing triangle-freeness in Boolean functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Property testing considers the task of testing rapidly (in particular, with very few samples into the data), if some massive data satisfies some given property, or is far from satisfying the property. For "global properties", i.e., properties that really depend somewhat on every piece of the data, one could ask how it can be tested by so few samples? We suggest that for "natural" properties, this should happen because the property is invariant under "nice" set of "relabellings" of the data. We refer to this set of relabellings as the "invariance class" of the property and advocate explicit identification of the invariance class of locally testable properties. Our hope is the explicit knowledge of the invariance class may lead to more general, broader, results. After pointing out the invariance classes associated with some the basic classes of testable properties, we focus on "algebraic properties" which seem to be characterized by the fact that the properties are themselves vector spaces, while their domains are also vector spaces and the properties are invariant under affine transformations of the domain. We survey recent results (obtained with Tali Kaufman, Elena Grigorescu and Eli Ben-Sasson) that give broad conditions that are sufficient for local testability among this class of properties, and some structural theorems that attempt to describe which properties exhibit the sufficient conditions.