Property testing

In computer science, a property testing algorithm for a decision problem is an algorithm whose query complexity to its input is much smaller than the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A property of finite graphs is called nondeterministically testable if it has a " certificate " such that once the certificate is… (More)
Is this relevant?
2012
2012
One motivation for property testing of boolean functions is the idea that testing can provide a fast preprocessing step before… (More)
Is this relevant?
2008
2008
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter 2 in… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We argue that the symmetries of a property being tested play a central role in property testing. We support this assertion in the… (More)
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is… (More)
Is this relevant?
2003
2003
Data dimensionality is a crucial issue in a variety of settings, where it is desirable to determine whether a data set given in a… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Property testing is a relaxation of decision problems in which it is required to distinguish YES-instances (i.e., objects having… (More)
Is this relevant?
2001
2001
A language <i>L</i> has a property tester if there exists a probabilistic algorithm that given an input <i>x</i> only asks a… (More)
Is this relevant?
2001
2001
This paper investigates geometric problems in the context of property testing algorithms. Property testing is an emerging area in… (More)
  • figure 1
Is this relevant?
2000
2000
We consider the notion of property testingas applied to computational geometry. We aim at developing efficient algorithms which… (More)
  • table 1
Is this relevant?