A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
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
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Three theorems regarding testing graph properties
Random Structures & Algorithms
Regularity lemma for k-uniform hypergraphs
Random Structures & Algorithms
The counting lemma for regular k-uniform hypergraphs
Random Structures & Algorithms
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 versus Estimation of Graph Properties
SIAM Journal on Computing
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
SIAM Journal on Computing
Algebraic property testing: the role of invariance
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Inverse conjecture for the gowers norm is false
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Every Monotone Graph Property Is Testable
SIAM Journal on Computing
Worst Case to Average Case Reductions for Polynomials
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Note: A combinatorial proof of the Removal Lemma for Groups
Journal of Combinatorial Theory Series A
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
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Generalizations of the removal lemma
Combinatorica
Lower bounds for testing triangle-freeness in Boolean functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A Unified Framework for Testing Linear-Invariant Properties
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
A Fourier-Analytic Approach to Reed-Muller Decoding
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Guest column: testing linear properties: some general theme
ACM SIGACT News
Correlation testing for affine invariant properties on Fpn in the high error regime
Proceedings of the forty-third annual ACM symposium on Theory of computing
Symmetric LDPC Codes are not Necessarily Locally Testable
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
Proximity oblivious testing and the role of invariances
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On Proximity-Oblivious Testing
SIAM Journal on Computing
Quadratic Goldreich-Levin Theorems
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
IEEE Transactions on Information Theory
SIAM Journal on Discrete Mathematics
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Testing odd-cycle-freeness in boolean functions
Combinatorics, Probability and Computing
Every locally characterized affine-invariant property is testable
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Testing linear-invariant function isomorphism
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
An affine-invariant property over a finite field is a property of functions over Fn/p that is closed under all affine transformations of the domain. This class of properties includes such well-known beasts as low-degree polynomials, polynomials that nontrivially factor, and functions of low spectral norm. The last few years has seen rapid progress in characterizing the affine-invariant properties which are testable with a constant number of queries. We survey the current state of this project.