Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms?
Victor LagerkvistMagnus WahlströmPublished in: CoRR (2018)
Keyphrases
- np hard
- np hard problems
- backtracking search
- approximate solutions
- constraint satisfaction problems
- computational complexity
- np complete
- optimization problems
- worst case
- np complete problems
- computationally hard
- graph coloring
- random instances
- constraint programming
- phase transition
- combinatorial problems
- search problems
- orders of magnitude
- special case
- hard problems
- decomposition methods
- approximation algorithms
- combinatorial optimization
- constraint satisfaction
- learning algorithm
- linear programming
- propositional satisfiability
- sat instances
- practical solutions
- decision problems
- sat encodings
- backtracking algorithm
- stochastic local search algorithms