Complexity of Max-SAT using stochastic algorithms

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 easyhard-eays transition. Categories and Subject Descriptors: I.2.8 [Artificial Intelligence]: Problem Solving, Control Methods, and Search–Heuristic methods; G.3 [Probability and Statistics]: Probabilistic algorithms. General Terms: Performance, Algorithms, Reliability.

• Type: Conference
• Year: 2008
• Where: GECCO
• Authors: Mohamed Qasem, Adam Prügel-Bennett
• Keywords: Exhaustive Search, GECCO 2008, Optimization, Phase Transition, SAT Problems