Complexity of max-sat using stochastic algorithms
Abstract
Hill-climbing has been shown to be more effective than ex-haustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other meth-ods to solve the most difficult region of SAT, the phase tran-sition. We show that hill-climbing also finds SAT problems difficult around the phase transition. It too follows an easy-hard-eays transition- text
- Categories and Subject Descriptors
- I.2.8 [Artificial Intelligence
- Problem Solving
- Control Methods
- and Search–Heuristic methods
- G.3 [Probability and Statis- tics
- Probabilistic algorithms. General Terms
- Performance
- Algorithms
- Reliability. Keywords
- Satisfiability
- Maximum Satisfiability
- Phase Transition
- Hill-climbing
Similar works
This paper was published in CiteSeerX.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.