Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Monotonicity testing over general poset domains
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Regular Languages are Testable with a Constant Number of Queries
SIAM Journal on Computing
Testing Membership in Languages that Have Small Width Branching Programs
SIAM Journal on Computing
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
On the strength of comparisons in property testing
Information and Computation
Some 3CNF Properties Are Hard to Test
SIAM Journal on Computing
The PCP theorem by gap amplification
Journal of the ACM (JACM)
Testing Properties of Constraint-Graphs
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Space Complexity Vs. Query Complexity
Computational Complexity
On the Query Complexity of Testing Orientations for Being Eulerian
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
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
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
| Hi-index | 0.00 |
We survey property testing results for the so called 'massively parametrized' model (or problems). The massively-parametrized framework studies problems such as: Given a graph G = (V,E), consider the property BI(G) containing all subgraphs of G that are bipartite. Massively parametrized Properties, such as BI(G), are defined by two ingredients: a 'general' property of inputs (e.g, 'being bipartite' for the example above), and an underlying given structure (the graph G for the property BI(G)). Then the property is the restriction of the general property to inputs that are associated with the given structure. In such situation, keeping the general property fixed and varying the underlying structure, the property and the corresponding tests might vary significantly in their structure. The focus of the study in this framework is how, for a fixed general property, the testing problem changes while changing the underlying structure.