Estimating the Number of Local Maxima for k-SAT Instances
نویسندگان
چکیده
We explore the applicability of a sampling method devised by J. Garnier and L. Kallel (SIAM J. Discrete Math., 2002) to approximate the number of local maxima in search spaces induced by k-SAT instances and a simple neighbourhood relation. The objective function is given by the number of satisfied clauses. Although the problem setting for k-SAT instances does not meet all pre-conditions required by the Garnier/Kallel-approach, we obtain approximations of the number of local maxima within the same order of magnitude as the exact values that have been determined by complete search. Since the comparison requires calculation of the complete set of local maxima, only small k-SAT instances have been considered so far. Furthermore, we outline a method for obtaining upper bounds for the average number of local maxima in k-SAT instances, which shows changes in the average number around the phase transition threshold.
منابع مشابه
Analysis of Local Search Landscapes for k-SAT Instances
Stochastic local search is a successful technique in diverse areas of combinatorial optimisation and is predominantly applied to hard problems. When dealing with individual instances of hard problems, gathering information about specific properties of instances in a preprocessing phase is helpful for an appropriate parameter adjustment of local search-based procedures. In the present paper, we ...
متن کاملA Theoretical Analysis of the k-Satisfiability Search Space
Local search algorithms perform surprisingly well on the ksatisfiability (k-SAT) problem. However, few theoretical analyses of the k-SAT search space exist. In this paper we study the search space of the k-SAT problem and show that it can be analyzed by a decomposition. In particular, we prove that the objective function can be represented as a superposition of exactly k elementary landscapes. ...
متن کاملBarriers and local minima in energy landscapes of stochastic local search
A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive adjacent states in an “energy landscape” defined by the problem instance on the n-dimensional Boolean hypercube. We investigate analytically the worst-case topography of such landscapes in the context of satisfiable k-S...
متن کاملComprehensive Score: Towards Efficient Local Search for SAT with Long Clauses
It is widely acknowledged that stochastic local search (SLS) algorithms can efficiently find models of satisfiable formulae for the Boolean Satisfiability (SAT) problem. There has been much interest in studying SLS algorithms on random k-SAT instances. Compared to random 3-SAT instances which have special statistical properties rendering them easy to solve, random k-SAT instances with long clau...
متن کامل