most citedExact phase transition of backtrack-free search with implications on the power of greedy algorithms

7 citations · 7 across the 1 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2008

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…