Polynomial Property Testing

Abstract

Property testers are fast, randomized "election polling"-type algorithms that determine if an input (e.g., graph or hypergraph) has a certain property or is $\epsilon$-far from the property. In the dense graph model of property testing, it is known that many properties can be tested with query complexity that depends only on the error parameter $\epsilon$ (and not on the size of the input), but the current bounds on the query complexity grow extremely quickly as a function of $1/\epsilon$. Which properties can be tested efficiently, i.e., with $\mathrm{poly}(1/\epsilon )$ queries? This survey presents the state of knowledge on this general question, as well as some key open problems.

Survey article to appear in Computer Science Review