Combinatorial Results on Directed Hypergraphs for the SAT Problem.
Cornelius CroitoruMadalina CroitoruPublished in: GKR (2015)
Keyphrases
- sat problem
- satisfiability problem
- sat solvers
- constraint satisfaction problems
- phase transition
- np complete
- boolean satisfiability
- max sat
- randomly generated
- propositional satisfiability
- sat instances
- random sat instances
- sat solving
- decision problems
- davis putnam
- branch and bound
- constraint satisfaction
- stochastic local search
- upper bound
- weighted max sat
- random sat
- decision making
- temporal logic
- orders of magnitude
- cnf formula
- lower bound