Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily.
Tobias FriedrichFrank NeumannRalf RothenbergerAndrew M. SuttonPublished in: SAT (2021)
Keyphrases
- random sat
- phase transition
- satisfiability problem
- sat problem
- random sat instances
- max sat
- stochastic local search
- constraint satisfaction
- sat instances
- randomly generated
- random constraint satisfaction problems
- boolean satisfiability
- graph coloring
- np complete
- temporal logic
- np complete problems
- search algorithm
- sat solvers
- davis putnam
- cellular automata