Hard SAT and CSP instances with Expander Graphs.
Carlos AnsóteguiRamón BéjarCèsar FernándezCarles MateuPublished in: ISAIM (2008)
Keyphrases
- random instances
- phase transition
- sat instances
- sat problem
- random graphs
- backtracking search
- np complete problems
- randomly generated
- constraint satisfaction problems
- satisfiability problem
- propositional satisfiability
- random sat
- sat solvers
- stochastic local search
- constraint satisfaction
- truth assignment
- np complete
- search algorithms for solving
- hard problems
- sat encodings
- graph coloring
- constraint programming
- graph matching
- lower bound
- benchmark instances
- search problems
- combinatorial problems
- branch and bound algorithm
- search algorithm
- search procedures
- solving hard
- random sat instances
- boolean satisfiability
- tractable classes
- max sat
- subgraph isomorphism
- constraint propagation
- graph mining
- constraint graph
- maximum satisfiability
- decomposition methods
- tabu search
- directed graph
- finding optimal solutions
- np hard
- backtrack search
- closest string
- search strategies
- graph theory
- orders of magnitude
- unit propagation
- optimal solution