Keyphrases
- np hard
- np complete
- satisfiability problem
- sat problem
- approximation algorithms
- scheduling problem
- sat solvers
- boolean variables
- special case
- constraint satisfaction problems
- closely related
- optimal solution
- boolean satisfiability
- np hardness
- computational complexity
- propositional satisfiability
- lower bound
- linear programming
- integer programming
- greedy heuristic
- branch and bound algorithm
- phase transition
- stochastic local search algorithms
- sat instances
- minimum cost
- sat solving
- remains np hard
- complexity analysis
- max sat
- stochastic local search
- knapsack problem
- computationally hard
- graph coloring
- worst case
- evolutionary algorithm
- variable ordering