The University of Southampton
University of Southampton Institutional Repository

Complexity of Max-SAT using stochastic algorithms

Qasem, Mohamed and Prugel-Bennett, Adam (2008) Complexity of Max-SAT using stochastic algorithms At Proceedings of the 10th annual conference on Genetic and evolutionary computation, Georgia.

Record type: Conference or Workshop Item (Poster)


Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other methods to solve the most difficult region of SAT, the phase transition. We show that hill-climbing also finds SAT problems difficult around the phase transition. It too follows an easy-hard-eays transition.

PDF t07pap188-qasem.pdf - Accepted Manuscript
Download (73kB)

More information

Published date: 2008
Additional Information: Event Dates: 2008
Venue - Dates: Proceedings of the 10th annual conference on Genetic and evolutionary computation, Georgia, 2008-01-01
Organisations: Southampton Wireless Group


Local EPrints ID: 268062
PURE UUID: 022de34d-ed9a-4a30-bd91-5dbd86a793d2

Catalogue record

Date deposited: 19 Oct 2009 09:35
Last modified: 18 Jul 2017 06:57

Export record


Author: Mohamed Qasem
Author: Adam Prugel-Bennett

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.