(2+ε)-SAT is NP-hard.
Per AustrinVenkatesan GuruswamiJohan HåstadPublished in: Electron. Colloquium Comput. Complex. (2013)
Keyphrases
- np hard
- satisfiability problem
- np complete
- sat problem
- sat solvers
- approximation algorithms
- scheduling problem
- boolean variables
- lower bound
- integer programming
- sat solving
- constraint satisfaction problems
- np hardness
- computational complexity
- closely related
- special case
- search algorithm
- optimal solution
- boolean satisfiability
- propositional satisfiability
- remains np hard
- search strategies
- decision problems
- linear programming
- worst case
- minimum cost
- stochastic local search algorithms
- phase transition
- backtracking search
- stochastic local search
- greedy heuristic
- approximation ratio
- learning algorithm
- objective function
- polynomial time approximation
- computationally hard
- set cover
- knapsack problem
- randomly generated