Improving configuration checking for satisfiable random k-SAT instances.
André AbraméDjamal HabetDonia ToumiPublished in: Ann. Math. Artif. Intell. (2017)
Keyphrases
- sat instances
- randomly generated
- random instances
- easy hard easy pattern
- satisfiability problem
- sat problem
- sat solvers
- phase transition
- computational properties
- random sat instances
- random sat
- np complete
- stochastic local search
- search algorithm
- constraint satisfaction problems
- max sat
- propositional satisfiability
- orders of magnitude
- boolean satisfiability
- computational complexity
- branch and bound algorithm
- constraint satisfaction
- information retrieval
- boolean formula
- search tree
- conjunctive normal form
- decision problems