.png){kind=icon}
Return
Polynomial property testing
.png){kind=icon}
OA
AI
DOI：10.1016/j.cosrev.2025.100806.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 ɛ-far from the property. It is known that many properties can be tested with query complexity that depends only on the error parameter ɛ (and not on the size of the input), but the current bounds on the query complexity grow extremely quickly as a function of 1ɛ. Which properties can be tested efficiently, i.e., with poly(1/ɛ) queries? This survey presents the state of knowledge on this general question, focusing on the dense graph model of property testing. Several key open problems are presented.
Keywords:
Property testing
Removal lemma
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12.7
Papers:
2.3K
Citations:
5.2K
Organization
Cited Papers
ShareSaveShareSaveV. Rödl and M. Schacht. Generalizations of the removal lemma. Combinatorica, 29(4):467–501, 2009..png)
IF0
PREAI
ShareSave
View more