Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems.
Daming ZhuShaohan MaPingping ZhangPublished in: COCOON (2011)
Keyphrases
- tight bounds
- satisfiability problem
- search algorithm
- stochastic local search
- upper bound
- search procedures
- np complete
- temporal logic
- phase transition
- sat problem
- solving hard
- stochastic local search algorithms
- graph coloring problems
- search space
- pspace complete
- finite domain
- mazurkiewicz traces
- sat instances
- branch and bound
- max sat
- clause learning
- tabu search
- propositional satisfiability
- search problems
- constraint satisfaction
- davis putnam
- linear programming
- knowledge representation
- lower bound