245 search results - page 7 / 49 » On the Average-Case Complexity of Property Testing |
76
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
99
Voted
STACS
2001
Springer
15 years 1 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
86
Voted
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
STOC
2003
ACM
15 years 9 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
84
Voted
ALGORITHMICA
2002
14 years 9 months ago
2002
Abstract. We consider the tasks of testing and spot-checking for data streams. These testers and spotcheckers are potentially useful in real-time or near real-time applications tha...