7 citations · 7 across the 1 of their papers we have counts for
2 papers
cs.AI2008★ 7 cited
Exact phase transition of backtrack-free search with implications on the power of greedy algorithms
Liang Li, Tian Liu, Ke Xu
Backtracking is a basic strategy to solve constraint satisfaction problems (CSPs). A satisfiable CSP instance is backtrack-free if a solution can be found without encountering any…
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…