Combinatorial landscape analysis for k-SAT instances

Albrecht, Andreas A., Lane, Peter C.R. and Steinhofel, Kathleen (2008) Combinatorial landscape analysis for k-SAT instances. In: 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence). IEEE, pp. 2498-2504. 9781424418220. (doi:10.1109/CEC.2008.4631133)

Full text is not in this repository.

Abstract

Over the past ten years, methods from statistical physics have provided a deeper inside into the average complexity of hard combinatorial problems, culminating in a rigorous proof for the asymptotic behaviour of the k-SAT phase transition threshold by Achlioptas and Peres in 2004. On the other hand, when dealing with individual instances of hard problems, gathering information about specific properties of instances in a pre-processing phase might be helpful for an appropriate adjustment of local search-based procedures. In the present paper, we address both issues in the context of landscapes induced by k-SAT instances: Firstly, we utilize a sampling method devised by Garnier and Kallel in 2002 for approximations of the number of local maxima in landscapes generated by individual k-SAT instances and a simple neighbourhood relation. The objective function is given by the number of satisfied clauses. Secondly, we outline a method for obtaining upper bounds for the average number of local maxima in k-SAT instances which indicates some kind of phase transition for the neighbourhood-specific ratio m/n = Theta(2k/k).

Item Type: Book Section
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 11140
Depositing User: Teddy ~
Date Deposited: 03 Jul 2013 12:34
Last Modified: 12 Jun 2019 12:49
ISBN: 9781424418220
URI: https://eprints.mdx.ac.uk/id/eprint/11140

Actions (login required)

Edit Item Edit Item