The Satisfiability Threshold for Non-Uniform Random 2-SAT.
Tobias FriedrichRalf RothenbergerPublished in: CoRR (2019)
Keyphrases
- random sat
- phase transition
- satisfiability problem
- sat problem
- random constraint satisfaction problems
- random sat instances
- max sat
- np complete
- boolean satisfiability
- stochastic local search
- sat instances
- randomly generated
- constraint satisfaction
- search algorithm
- graph coloring
- combinatorial problems
- davis putnam
- sat solvers
- np hard
- integer linear programming
- cnf formula
- propositional logic
- lower bound