|
|
Zapiski Nauchnykh Seminarov POMI, 2012, Volume 399, Pages 15–31
(Mi znsl5219)
|
|
|
|
Optimal heuristic algorithms for the image of an injective function
E. A. Hirscha, D. M. Itsyksona, V. O. Nikolaenkob, A. V. Smala a St. Petersburg Department of the Steklov Mathematical Institute, St. Petersburg, Russia
b St. Petersburg Academic University, St. Petersburg, Russia
Abstract:
The existence of optimal algorithms is not known for any decision problem in $\mathbf{NP}\setminus\mathbf{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 $\frac1d$ 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.
Key words and phrases:
optimal algorithm, heuristic algorithm.
Received: 31.07.2011
Citation:
E. A. Hirsch, D. M. Itsykson, V. O. Nikolaenko, A. V. Smal, “Optimal heuristic algorithms for the image of an injective function”, Computational complexity theory. Part X, Zap. Nauchn. Sem. POMI, 399, POMI, St. Petersburg, 2012, 15–31; J. Math. Sci. (N. Y.), 188:1 (2013), 7–16
Linking options:
https://www.mathnet.ru/eng/znsl5219 https://www.mathnet.ru/eng/znsl/v399/p15
|
|