Property Testing of Massively Parametrized Problems - A Survey

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.

[1]  Ilan Newman.  Testing Membership in Languages that Have Small Width Branching Programs , 2002, SIAM J. Comput..

[2]  E. Fischer.  THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .

[3]  Eldar Fischer.  On the strength of comparisons in property testing , 2004, Inf. Comput..

[4]  Eldar Fischer,et al.  Testing st -Connectivity , 2007, APPROX-RANDOM.

[5]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[6]  D. Ron,et al.  Testing properties of directed graphs: acyclicity and connectivity , 2002 .

[7]  Dana Ron,et al.  Property Testing , 2000 .

[8]  A. Kostochka.  The minimum Hadwiger number for graphs with a given mean degree of vertices , 1982 .

[9]  Irit Dinur,et al.  The PCP theorem by gap amplification , 2006, STOC.

[10]  Kyomin Jung,et al.  Transitive-Closure Spanners , 2008, SIAM J. Comput..

[11]  Dekel Tsur,et al.  Testing Properties of Constraint-Graphs , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[12]  Eldar Fischer,et al.  On the query complexity of testing orientations for being Eulerian , 2008, TALG.

[13]  Sorin C. Popescu,et al.  Lidar Remote Sensing , 2011 .

[14]  Dekel Tsur,et al.  Testing Orientation Properties , 2005, Electron. Colloquium Comput. Complex..

[15]  Kyomin Jung,et al.  Transitive-Closure Spanners of the Hypercube and the Hypergrid , 2009, Electron. Colloquium Comput. Complex..

[16]  Noga Alon,et al.  Regular languages are testable with a constant number of queries , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[17]  Eli Ben-Sasson,et al.  Some 3CNF properties are hard to test , 2003, STOC '03.

[18]  Ronitt Rubinfeld,et al.  Monotonicity testing over general poset domains , 2002, STOC '02.

[19]  A. Thomason.  An extremal function for contractions of graphs , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.

[20]  Asaf Shapira,et al.  Space Complexity Vs. Query Complexity , 2008, computational complexity.

[21]  Noga Alon.  Testing subgraphs in large graphs , 2002, Random Struct. Algorithms.

[22]  Sanguthevar Rajasekaran.  Handbook of randomized computing , 2001 .