Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > DISTANCE ESTIMATORS:
Reports tagged with Distance Estimators:
TR10-119 | 27th July 2010
Michal Moshkovitz

Distance Estimators with Sublogarithmic Number of Queries

A distance estimator is a code together with a randomized algorithm. The algorithm approximates the distance of any word from the code by making a small number of queries to the word. One such example is the Reed-Muller code equipped with an appropriate algorithm. It has polynomial length, polylogarithmic alphabet ... more >>>




ISSN 1433-8092 | Imprint