Generating Hard SAT/CSP Instances Using Expander Graphs.
Carlos AnsóteguiRamón BéjarCèsar FernándezCarles MateuPublished in: AAAI (2008)
Keyphrases
- random instances
- phase transition
- sat instances
- random graphs
- sat problem
- constraint satisfaction problems
- backtracking search
- np complete problems
- satisfiability problem
- randomly generated
- constraint satisfaction
- sat solvers
- random sat
- stochastic local search
- propositional satisfiability
- truth assignment
- np complete
- search procedures
- lower bound
- graph coloring
- tractable classes
- boolean satisfiability
- hard problems
- sat encodings
- maximum satisfiability
- search problems
- graph theory
- graph mining
- constraint programming
- random sat instances
- max sat
- combinatorial problems
- backtrack search
- directed graph
- constraint graph
- closest string
- search space
- solving hard
- polynomial size
- clause learning
- subgraph isomorphism
- constraint propagation
- graph matching
- davis putnam
- weighted graph
- branch and bound algorithm
- heuristic search
- orders of magnitude
- search algorithms for solving