Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > RANDOM ALGORITHMS:
Reports tagged with random algorithms:
TR01-008 | 6th November 2000
Eldar Fischer

On the strength of comparisons in property testing

An \epsilon-test for a property P of functions from
{\cal D}=\{1,\ldots,d\} to the positive integers is a randomized
algorithm, which makes queries on the value of an input function at
specified locations, and distinguishes with high probability between the
case of the function satisfying P, and the case that it ... more >>>




ISSN 1433-8092 | Imprint