Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR11-091 | 20th May 2011 12:07

Optimal heuristic algorithms for the image of an injective function

RSS-Feed




TR11-091
Authors: Edward Hirsch, Dmitry Itsykson, Valeria Nikolaenko, Alexander Smal
Publication: 10th June 2011 17:07
Downloads: 1356
Keywords: 


Abstract:

The existence of optimal algorithms is not known for any decision problem in NP$\setminus$P. We consider the problem of testing the membership in the image of an injective function. We construct optimal heuristic algorithms for this problem in both randomized and deterministic settings (a heuristic algorithm can err on a small fraction 1/d of the inputs; the parameter d is given to it as an additional input). Thus for this problem we improve an earlier construction of an optimal acceptor (that is optimal on the negative instances only) and also give a deterministic version.



ISSN 1433-8092 | Imprint