(2+ε)-Sat Is NP-hard.
Per AustrinVenkatesan GuruswamiJohan HåstadPublished in: SIAM J. Comput. (2017)
Keyphrases
- np hard
- np complete
- satisfiability problem
- sat problem
- optimal solution
- lower bound
- boolean variables
- approximation algorithms
- branch and bound algorithm
- sat solvers
- scheduling problem
- boolean satisfiability
- special case
- linear programming
- constraint satisfaction problems
- np hardness
- worst case
- phase transition
- integer programming
- minimum cost
- propositional satisfiability
- max sat
- stochastic local search algorithms
- computational complexity
- randomly generated
- search algorithm
- set cover
- decision problems
- remains np hard
- sat solving
- variable ordering
- search procedures
- genetic algorithm
- search problems
- search space
- closely related