The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
— Many real-world problems demand a feasible solution to satisfy physical equilibrium, stability, or certain properties which require an additional lower level optimization probl...
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...
L. Darrell Whitley, J. Francisco Chicano, Enrique ...
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried...