Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms
Wolfgang BarthelAlexander K. HartmannMartin WeigtPublished in: CoRR (2003)
Keyphrases
- satisfiability problem
- stochastic local search algorithms
- solving hard
- stochastic local search
- sat instances
- np complete
- search algorithm
- phase transition
- temporal logic
- finite domain
- sat problem
- davis putnam logemann loveland
- graph coloring problems
- pspace complete
- max sat
- random sat
- davis putnam
- reinforcement learning
- combinatorial optimization
- cellular automata
- search space