Improving WalkSAT for Random 3-SAT Problems.
Huimin FuYang XuShuwei ChenJun LiuPublished in: J. Univers. Comput. Sci. (2020)
Keyphrases
- sat problem
- random sat
- satisfiability problem
- randomly generated
- boolean satisfiability
- phase transition
- constraint satisfaction problems
- np complete
- stochastic local search
- sat solvers
- max sat
- constraint satisfaction
- propositional satisfiability
- maximum satisfiability
- solving hard
- sat solving
- backtracking search
- davis putnam
- truth assignment
- sat instances
- branch and bound
- np complete problems
- temporal logic
- search algorithm
- constraint programming
- boolean functions
- information retrieval systems
- lower bound