Complexity of Max-SAT using stochastic algorithms

Mohamed Qasem, Adam Prügel-Bennett

Abstract: 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.