Hardness of Approximation Algorithms on k-SAT and (k, s)-SAT Problems.
Tianyan DengDaoyun XuPublished in: ICYCS (2008)
Keyphrases
- approximation algorithms
- sat problem
- phase transition
- np hard
- np complete
- satisfiability problem
- np hardness
- constraint satisfaction problems
- boolean satisfiability
- worst case
- special case
- constraint satisfaction
- vertex cover
- sat solvers
- propositional satisfiability
- decision problems
- sat instances
- max sat
- randomly generated
- sat solving
- davis putnam
- backtracking search
- approximation ratio
- stochastic local search
- scheduling problem
- computational complexity
- systematic search algorithms
- maximum satisfiability
- branch and bound algorithm
- combinatorial problems
- solving hard
- graph coloring
- constant factor
- linear programming
- search algorithm
- optimal solution
- cnf formula
- lower bound
- constant factor approximation
- clause learning
- orders of magnitude
- learning algorithm
- genetic algorithm