Hierarchy Theorems for Property Testing

Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prove the existence of properties that have testing complexity Θ(q). Such results are proven in three standard domains often considered in property testing: generic functions, adjacency predicates describing (dense) graphs, and incidence functions describing bounded-degree graphs. While in two cases the proofs are quite straightforward, the techniques employed in the case of the dense graph model seem significantly more involved. Specifically, problems that arise and are treated in the latter case include (1) the preservation of distances between graph under a blow-up operation, and (2) the construction of monotone graph properties that have local structure.

• Type: Conference
• Year: 2009
• Where: APPROX
• Authors: Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg
• Keywords: Algorithms, APPROX 2009, Dense Graph Model, Property Testing, Query Complexity