Satisfiability threshold of the random regular (s, c, k)-SAT problem.
Xiaoling MoDaoyun XuKai YanZaijun ZhangPublished in: Frontiers Comput. Sci. (2022)
Keyphrases
- sat problem
- satisfiability problem
- randomly generated
- random sat
- random sat instances
- phase transition
- np complete
- constraint satisfaction problems
- sat solvers
- sat instances
- max sat
- sat solving
- boolean satisfiability
- davis putnam
- truth assignment
- random instances
- stochastic local search
- propositional satisfiability
- maximum satisfiability
- weighted max sat
- decision problems
- branch and bound algorithm
- np complete problems
- temporal logic
- information retrieval
- constraint satisfaction
- genetic algorithm
- search space
- clause learning
- boolean formula
- graph coloring
- branch and bound
- cnf formula
- evolutionary algorithm
- search tree
- reinforcement learning
- search algorithm