From k-SAT to k-CSP: Two Generalized Algorithms

Liang Li, Xin Li, Tian Liu +1

Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bou…