Hromkovic, J. Algorithmics for Hard Problems. Springer, 2001.Algorithmics for Hard Problems - Hormkovic - 2002 () Citation Context ...l solution. Randomized algorithm may be used to eliminate opaque predicates, in this case the probability of precisely detecting an opaque predicate can be ...
There are several approaches to attack hard problems. All have their merits, but also their limitations, and need a large body of theory as their basis. A number of books for each one exist: books on complexity theory, others on approximation algorithms, heuristic approaches, parametrized ...