Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > TESTING GRAPH PROPERTIES:
Reports tagged with Testing Graph Properties:
TR96-057 | 18th November 1996
Oded Goldreich, Dana Ron

Property Testing and its connection to Learning and Approximation


In this paper, we consider the question of determining whether
a function $f$ has property $P$ or is $\e$-far from any
function with property $P$.
The property testing algorithm is given a sample of the value
of $f$ on instances drawn according to some distribution.
In some cases,
more >>>


TR18-098 | 17th May 2018
Oded Goldreich

Hierarchy Theorems for Testing Properties in Size-Oblivious Query Complexity

Focusing on property testing tasks that have query complexity that is independent of the size of the tested object (i.e., depends on the proximity parameter only), we prove the existence of a rich hierarchy of the corresponding complexity classes.
That is, for essentially any function $q:(0,1]\to\N$, we prove the existence ... more >>>


TR18-104 | 29th May 2018
Oded Goldreich

Flexible models for testing graph properties

Revisions: 1

The standard models of testing graph properties postulate that the vertex-set consists of $\{1,2,...,n\}$, where $n$ is a natural number that is given explicitly to the tester.
Here we suggest more flexible models by postulating that the tester is given access to samples the arbitrary vertex-set; that is, the vertex-set ... more >>>




ISSN 1433-8092 | Imprint