SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Sampling algorithms: lower bounds and applications
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
The difficulty of testing for isomorphism against a graph that is given in advance
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Testing versus estimation of graph properties
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
ω-Regular languages are testable with a constant number of queries
Theoretical Computer Science
Linear equations, arithmetic progressions and hypergraph property testing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Probabilistic abstraction for model checking: An approach based on property testing
ACM Transactions on Computational Logic (TOCL)
Testing symmetric properties of distributions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Testing monotonicity over graph products
Random Structures & Algorithms
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
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
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
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
On proximity oblivious testing
Proceedings of the forty-first annual ACM symposium on Theory of computing
Hierarchy Theorems for Property Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
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
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Indistinguishability and first-order logic
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Distributed discovery of large near-cliques
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Property testing and parameter testing for permutations
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Lower bounds for testing triangle-freeness in Boolean functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Introduction to testing graph properties
Property testing
Hierarchy theorems for property testing
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
Introduction to testing graph properties
Property testing
Hierarchy theorems for property testing
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
Testing permutation properties through subpermutations
Theoretical Computer Science
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the average-case complexity of property testing
Studies in complexity and cryptography
Studies in complexity and cryptography
Proximity oblivious testing and the role of invariances
Studies in complexity and cryptography
Introduction to testing graph properties
Studies in complexity and cryptography
Contemplations on testing graph properties
Studies in complexity and cryptography
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
A canonical form for testing boolean function properties
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Inflatable graph properties and natural property tests
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
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
Algorithmic Aspects of Property Testing in the Dense Graphs Model
SIAM Journal on Computing
On Proximity-Oblivious Testing
SIAM Journal on Computing
Testing odd-cycle-freeness in Boolean functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Space complexity vs. query complexity
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
A nearly-quadratic gap between adaptive and non-adaptive property testers
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Testing Symmetric Properties of Distributions
SIAM Journal on Computing
On the possibilities and limitations of pseudodeterministic algorithms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Testing Closeness of Discrete Distributions
Journal of the ACM (JACM)
Hi-index | 0.00 |
Property testing is a relaxation of decision problems in which it is required to distinguish YES-instances (i.e., objects having a predetermined property) from instances that are far from any YES-instance. We presents three theorems regarding testing graph properties in the adjacency matrix representation. More specifically, these theorems relate to the project of characterizing graph properties according to the complexity of testing them (in the adjacency matrix representation). The first theorem is that there exist monotone graph properties in NP for which testing is very hard (i.e., requires to examine a constant fraction of the entries in the matrix). The second theorem is that every graph property that can be tested making a number of queries that is independent of the size of the graph can be so tested by uniformly selecting a set of vertices and accepting iff the induced subgraph has some fixed graph property (which is not necessarily the same as the one being tested). The third theorem refers to the framework of graph partition problems, and is a characterization of the subclass of properties that can be tested using a one-sided error tester making a number of queries that is independent of the size of the graph.